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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label52.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 ddbc486d8837447489a9f02b29f9b0c86837a784a73349e3a6819c320282b326
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 10:39:13,701 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 10:39:13,758 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 10:39:13,764 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 10:39:13,766 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 10:39:13,785 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 10:39:13,786 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 10:39:13,786 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 10:39:13,787 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 10:39:13,787 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 10:39:13,787 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 10:39:13,787 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 10:39:13,787 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 10:39:13,787 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 10:39:13,788 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 10:39:13,788 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 10:39:13,789 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 10:39:13,789 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 10:39:13,789 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 10:39:13,789 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 10:39:13,789 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 10:39:13,789 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 10:39:13,789 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 10:39:13,789 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:39:13,790 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 10:39:13,790 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 10:39:13,790 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 10:39:13,790 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 10:39:13,790 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 10:39:13,790 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 10:39:13,790 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 10:39:13,790 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 10:39:13,790 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 10:39:13,790 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 10:39:13,791 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 -> ddbc486d8837447489a9f02b29f9b0c86837a784a73349e3a6819c320282b326
[2025-03-03 10:39:14,107 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 10:39:14,115 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 10:39:14,117 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 10:39:14,118 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 10:39:14,119 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 10:39:14,120 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label52.c
[2025-03-03 10:39:15,252 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37256af1/21db995635f24ef1bc133f51503f0192/FLAGf4eaffdff
[2025-03-03 10:39:15,720 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 10:39:15,721 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label52.c
[2025-03-03 10:39:15,745 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37256af1/21db995635f24ef1bc133f51503f0192/FLAGf4eaffdff
[2025-03-03 10:39:15,759 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37256af1/21db995635f24ef1bc133f51503f0192
[2025-03-03 10:39:15,762 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 10:39:15,763 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 10:39:15,764 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 10:39:15,764 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 10:39:15,768 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 10:39:15,769 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:39:15" (1/1) ...
[2025-03-03 10:39:15,769 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bb72c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:15, skipping insertion in model container
[2025-03-03 10:39:15,769 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:39:15" (1/1) ...
[2025-03-03 10:39:15,851 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 10:39:16,000 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/Problem12_label52.c[3994,4007]
[2025-03-03 10:39:16,440 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:39:16,449 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 10:39:16,462 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/Problem12_label52.c[3994,4007]
[2025-03-03 10:39:16,693 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:39:16,709 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 10:39:16,710 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16 WrapperNode
[2025-03-03 10:39:16,710 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 10:39:16,711 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 10:39:16,711 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 10:39:16,711 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 10:39:16,715 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:16,757 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:16,968 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-03-03 10:39:16,968 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 10:39:16,969 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 10:39:16,969 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 10:39:16,969 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 10:39:16,975 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:16,976 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:17,009 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:17,112 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 10:39:17,113 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:17,113 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:17,181 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:17,195 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:17,213 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:17,227 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:17,260 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 10:39:17,262 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 10:39:17,262 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 10:39:17,262 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 10:39:17,262 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (1/1) ...
[2025-03-03 10:39:17,266 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:39:17,275 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:39:17,285 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 10:39:17,290 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 10:39:17,303 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 10:39:17,303 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 10:39:17,303 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 10:39:17,303 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 10:39:17,351 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 10:39:17,352 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 10:39:20,497 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-03-03 10:39:20,498 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-03-03 10:39:20,498 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-03-03 10:39:20,681 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-03-03 10:39:20,682 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 10:39:20,709 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 10:39:20,709 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 10:39:20,714 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:39:20 BoogieIcfgContainer
[2025-03-03 10:39:20,714 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 10:39:20,716 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 10:39:20,716 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 10:39:20,720 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 10:39:20,720 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:39:15" (1/3) ...
[2025-03-03 10:39:20,721 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496d0cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:39:20, skipping insertion in model container
[2025-03-03 10:39:20,721 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:16" (2/3) ...
[2025-03-03 10:39:20,722 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496d0cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:39:20, skipping insertion in model container
[2025-03-03 10:39:20,722 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:39:20" (3/3) ...
[2025-03-03 10:39:20,723 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label52.c
[2025-03-03 10:39:20,736 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 10:39:20,737 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label52.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 10:39:20,809 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 10:39:20,818 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;@3a0ff7f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 10:39:20,819 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 10:39:20,824 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:20,829 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2025-03-03 10:39:20,829 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:20,830 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]
[2025-03-03 10:39:20,830 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:20,833 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:20,834 INFO  L85        PathProgramCache]: Analyzing trace with hash -1709532998, now seen corresponding path program 1 times
[2025-03-03 10:39:20,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:20,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237895848]
[2025-03-03 10:39:20,841 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:20,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:20,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes.
[2025-03-03 10:39:20,923 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements.
[2025-03-03 10:39:20,924 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:20,925 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:21,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:39:21,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:21,071 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237895848]
[2025-03-03 10:39:21,071 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237895848] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:21,071 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:21,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:39:21,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280168964]
[2025-03-03 10:39:21,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:21,075 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:21,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:21,088 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:21,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:21,091 INFO  L87              Difference]: Start difference. First operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:23,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:23,866 INFO  L93              Difference]: Finished difference Result 2404 states and 4642 transitions.
[2025-03-03 10:39:23,867 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:23,868 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30
[2025-03-03 10:39:23,868 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:23,881 INFO  L225             Difference]: With dead ends: 2404
[2025-03-03 10:39:23,881 INFO  L226             Difference]: Without dead ends: 1506
[2025-03-03 10:39:23,886 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:23,888 INFO  L435           NwaCegarLoop]: 515 mSDtfsCounter, 790 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:23,888 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-03-03 10:39:23,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-03-03 10:39:23,952 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-03-03 10:39:23,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:23,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions.
[2025-03-03 10:39:23,962 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 30
[2025-03-03 10:39:23,963 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:23,963 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions.
[2025-03-03 10:39:23,963 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:23,963 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions.
[2025-03-03 10:39:23,965 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-03 10:39:23,965 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:23,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:39:23,965 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 10:39:23,965 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:23,966 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:23,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 2052796436, now seen corresponding path program 1 times
[2025-03-03 10:39:23,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:23,966 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901957156]
[2025-03-03 10:39:23,966 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:23,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:23,982 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-03 10:39:24,011 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-03 10:39:24,012 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:24,012 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:24,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:39:24,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:24,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901957156]
[2025-03-03 10:39:24,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901957156] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:24,178 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:24,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:39:24,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905981472]
[2025-03-03 10:39:24,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:24,179 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:24,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:24,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:24,180 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:24,181 INFO  L87              Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:26,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:26,655 INFO  L93              Difference]: Finished difference Result 4514 states and 7250 transitions.
[2025-03-03 10:39:26,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:26,656 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105
[2025-03-03 10:39:26,656 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:26,665 INFO  L225             Difference]: With dead ends: 4514
[2025-03-03 10:39:26,665 INFO  L226             Difference]: Without dead ends: 3010
[2025-03-03 10:39:26,670 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:26,671 INFO  L435           NwaCegarLoop]: 576 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:26,671 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 583 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-03 10:39:26,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3010 states.
[2025-03-03 10:39:26,720 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008.
[2025-03-03 10:39:26,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3008 states, 3007 states have (on average 1.4595942800133024) internal successors, (4389), 3007 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:26,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4389 transitions.
[2025-03-03 10:39:26,730 INFO  L78                 Accepts]: Start accepts. Automaton has 3008 states and 4389 transitions. Word has length 105
[2025-03-03 10:39:26,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:26,730 INFO  L471      AbstractCegarLoop]: Abstraction has 3008 states and 4389 transitions.
[2025-03-03 10:39:26,730 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:26,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 3008 states and 4389 transitions.
[2025-03-03 10:39:26,736 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-03 10:39:26,736 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:26,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:39:26,736 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 10:39:26,736 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:26,739 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:26,739 INFO  L85        PathProgramCache]: Analyzing trace with hash -1592465386, now seen corresponding path program 1 times
[2025-03-03 10:39:26,739 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:26,739 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078075238]
[2025-03-03 10:39:26,739 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:26,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:26,757 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-03 10:39:26,781 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-03 10:39:26,784 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:26,784 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:26,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:39:26,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:26,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078075238]
[2025-03-03 10:39:26,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078075238] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:26,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:26,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:39:26,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606132402]
[2025-03-03 10:39:26,948 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:26,948 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:26,948 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:26,948 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:26,949 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:26,949 INFO  L87              Difference]: Start difference. First operand 3008 states and 4389 transitions. Second operand  has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:28,978 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:28,979 INFO  L93              Difference]: Finished difference Result 9018 states and 13162 transitions.
[2025-03-03 10:39:28,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:28,979 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 134
[2025-03-03 10:39:28,980 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:28,997 INFO  L225             Difference]: With dead ends: 9018
[2025-03-03 10:39:28,997 INFO  L226             Difference]: Without dead ends: 6012
[2025-03-03 10:39:29,000 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:29,001 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 745 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:29,001 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 447 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 10:39:29,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6012 states.
[2025-03-03 10:39:29,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012.
[2025-03-03 10:39:29,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6012 states, 6011 states have (on average 1.2951256030610547) internal successors, (7785), 6011 states have internal predecessors, (7785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:29,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7785 transitions.
[2025-03-03 10:39:29,086 INFO  L78                 Accepts]: Start accepts. Automaton has 6012 states and 7785 transitions. Word has length 134
[2025-03-03 10:39:29,086 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:29,087 INFO  L471      AbstractCegarLoop]: Abstraction has 6012 states and 7785 transitions.
[2025-03-03 10:39:29,087 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:29,087 INFO  L276                IsEmpty]: Start isEmpty. Operand 6012 states and 7785 transitions.
[2025-03-03 10:39:29,088 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2025-03-03 10:39:29,088 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:29,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:39:29,088 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 10:39:29,089 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:29,090 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:29,090 INFO  L85        PathProgramCache]: Analyzing trace with hash -1299587345, now seen corresponding path program 1 times
[2025-03-03 10:39:29,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:29,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146303200]
[2025-03-03 10:39:29,090 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:29,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:29,111 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-03-03 10:39:29,128 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-03-03 10:39:29,129 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:29,129 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:29,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2025-03-03 10:39:29,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:29,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146303200]
[2025-03-03 10:39:29,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146303200] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:39:29,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538837534]
[2025-03-03 10:39:29,416 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:29,416 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:39:29,416 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:39:29,418 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:39:29,420 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 10:39:29,462 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-03-03 10:39:29,489 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-03-03 10:39:29,489 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:29,489 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:29,491 INFO  L256         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:39:29,495 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:39:29,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-03-03 10:39:29,693 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:39:29,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538837534] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:29,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:39:29,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-03 10:39:29,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463084040]
[2025-03-03 10:39:29,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:29,694 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:29,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:29,695 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:29,695 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:39:29,695 INFO  L87              Difference]: Start difference. First operand 6012 states and 7785 transitions. Second operand  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:31,844 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:31,844 INFO  L93              Difference]: Finished difference Result 18030 states and 23350 transitions.
[2025-03-03 10:39:31,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:31,845 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 171
[2025-03-03 10:39:31,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:31,871 INFO  L225             Difference]: With dead ends: 18030
[2025-03-03 10:39:31,871 INFO  L226             Difference]: Without dead ends: 12020
[2025-03-03 10:39:31,877 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:39:31,879 INFO  L435           NwaCegarLoop]: 655 mSDtfsCounter, 623 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:31,879 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 662 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 10:39:31,891 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12020 states.
[2025-03-03 10:39:31,991 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 11269.
[2025-03-03 10:39:32,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11269 states, 11268 states have (on average 1.2277245296414625) internal successors, (13834), 11268 states have internal predecessors, (13834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:32,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13834 transitions.
[2025-03-03 10:39:32,021 INFO  L78                 Accepts]: Start accepts. Automaton has 11269 states and 13834 transitions. Word has length 171
[2025-03-03 10:39:32,022 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:32,022 INFO  L471      AbstractCegarLoop]: Abstraction has 11269 states and 13834 transitions.
[2025-03-03 10:39:32,022 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:32,022 INFO  L276                IsEmpty]: Start isEmpty. Operand 11269 states and 13834 transitions.
[2025-03-03 10:39:32,023 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-03-03 10:39:32,023 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:32,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:39:32,030 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 10:39:32,224 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:39:32,224 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:32,225 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:32,225 INFO  L85        PathProgramCache]: Analyzing trace with hash -50945742, now seen corresponding path program 1 times
[2025-03-03 10:39:32,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:32,225 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982923943]
[2025-03-03 10:39:32,225 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:32,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:32,240 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-03-03 10:39:32,256 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-03-03 10:39:32,256 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:32,256 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:32,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:39:32,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:32,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982923943]
[2025-03-03 10:39:32,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982923943] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:32,695 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:32,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:39:32,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332682098]
[2025-03-03 10:39:32,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:32,696 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 10:39:32,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:32,696 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 10:39:32,696 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:39:32,696 INFO  L87              Difference]: Start difference. First operand 11269 states and 13834 transitions. Second operand  has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:36,518 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:36,519 INFO  L93              Difference]: Finished difference Result 29295 states and 35079 transitions.
[2025-03-03 10:39:36,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 10:39:36,519 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 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 174
[2025-03-03 10:39:36,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:36,547 INFO  L225             Difference]: With dead ends: 29295
[2025-03-03 10:39:36,547 INFO  L226             Difference]: Without dead ends: 18028
[2025-03-03 10:39:36,554 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:39:36,554 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 2734 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6150 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 6309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 6150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:36,554 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 726 Invalid, 6309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 6150 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time]
[2025-03-03 10:39:36,564 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18028 states.
[2025-03-03 10:39:36,684 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 16526.
[2025-03-03 10:39:36,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16526 states, 16525 states have (on average 1.1745234493192134) internal successors, (19409), 16525 states have internal predecessors, (19409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:36,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 19409 transitions.
[2025-03-03 10:39:36,724 INFO  L78                 Accepts]: Start accepts. Automaton has 16526 states and 19409 transitions. Word has length 174
[2025-03-03 10:39:36,725 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:36,726 INFO  L471      AbstractCegarLoop]: Abstraction has 16526 states and 19409 transitions.
[2025-03-03 10:39:36,727 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:36,727 INFO  L276                IsEmpty]: Start isEmpty. Operand 16526 states and 19409 transitions.
[2025-03-03 10:39:36,729 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2025-03-03 10:39:36,729 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:36,729 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:39:36,729 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 10:39:36,731 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:36,731 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:36,731 INFO  L85        PathProgramCache]: Analyzing trace with hash 923115849, now seen corresponding path program 1 times
[2025-03-03 10:39:36,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:36,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315235713]
[2025-03-03 10:39:36,731 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:36,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:36,748 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-03-03 10:39:36,761 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-03-03 10:39:36,762 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:36,762 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:36,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 125 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-03-03 10:39:36,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:36,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315235713]
[2025-03-03 10:39:36,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315235713] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:36,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:36,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:39:36,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341846406]
[2025-03-03 10:39:36,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:36,835 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:36,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:36,835 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:36,836 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:36,836 INFO  L87              Difference]: Start difference. First operand 16526 states and 19409 transitions. Second operand  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:39,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:39,298 INFO  L93              Difference]: Finished difference Result 39058 states and 46760 transitions.
[2025-03-03 10:39:39,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:39,299 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242
[2025-03-03 10:39:39,299 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:39,334 INFO  L225             Difference]: With dead ends: 39058
[2025-03-03 10:39:39,334 INFO  L226             Difference]: Without dead ends: 22534
[2025-03-03 10:39:39,348 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:39,349 INFO  L435           NwaCegarLoop]: 683 mSDtfsCounter, 725 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:39,349 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 690 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-03-03 10:39:39,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22534 states.
[2025-03-03 10:39:39,474 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 16526.
[2025-03-03 10:39:39,490 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16526 states, 16525 states have (on average 1.1745234493192134) internal successors, (19409), 16525 states have internal predecessors, (19409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:39,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 19409 transitions.
[2025-03-03 10:39:39,506 INFO  L78                 Accepts]: Start accepts. Automaton has 16526 states and 19409 transitions. Word has length 242
[2025-03-03 10:39:39,506 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:39,506 INFO  L471      AbstractCegarLoop]: Abstraction has 16526 states and 19409 transitions.
[2025-03-03 10:39:39,506 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:39,506 INFO  L276                IsEmpty]: Start isEmpty. Operand 16526 states and 19409 transitions.
[2025-03-03 10:39:39,508 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 246
[2025-03-03 10:39:39,508 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:39,508 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:39:39,508 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 10:39:39,508 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:39,509 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:39,509 INFO  L85        PathProgramCache]: Analyzing trace with hash 1195160982, now seen corresponding path program 1 times
[2025-03-03 10:39:39,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:39,509 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665518283]
[2025-03-03 10:39:39,509 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:39,509 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:39,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes.
[2025-03-03 10:39:39,532 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements.
[2025-03-03 10:39:39,532 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:39,532 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:39,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:39:39,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:39,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665518283]
[2025-03-03 10:39:39,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665518283] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:39,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:39,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:39:39,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38038670]
[2025-03-03 10:39:39,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:39,746 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:39:39,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:39,746 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:39:39,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:39:39,747 INFO  L87              Difference]: Start difference. First operand 16526 states and 19409 transitions. Second operand  has 4 states, 4 states have (on average 61.25) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:41,973 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:41,973 INFO  L93              Difference]: Finished difference Result 37593 states and 43653 transitions.
[2025-03-03 10:39:41,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:39:41,974 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 61.25) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 245
[2025-03-03 10:39:41,974 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:42,002 INFO  L225             Difference]: With dead ends: 37593
[2025-03-03 10:39:42,002 INFO  L226             Difference]: Without dead ends: 21032
[2025-03-03 10:39:42,017 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-03 10:39:42,018 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:42,018 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 10:39:42,031 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21032 states.
[2025-03-03 10:39:42,159 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21032 to 21032.
[2025-03-03 10:39:42,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21032 states, 21031 states have (on average 1.140554419666207) internal successors, (23987), 21031 states have internal predecessors, (23987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:42,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21032 states to 21032 states and 23987 transitions.
[2025-03-03 10:39:42,194 INFO  L78                 Accepts]: Start accepts. Automaton has 21032 states and 23987 transitions. Word has length 245
[2025-03-03 10:39:42,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:42,194 INFO  L471      AbstractCegarLoop]: Abstraction has 21032 states and 23987 transitions.
[2025-03-03 10:39:42,194 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 61.25) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:42,194 INFO  L276                IsEmpty]: Start isEmpty. Operand 21032 states and 23987 transitions.
[2025-03-03 10:39:42,196 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2025-03-03 10:39:42,196 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:42,196 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:39:42,197 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 10:39:42,197 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:42,197 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:42,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 744303206, now seen corresponding path program 1 times
[2025-03-03 10:39:42,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:42,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774458619]
[2025-03-03 10:39:42,197 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:42,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:42,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes.
[2025-03-03 10:39:42,222 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements.
[2025-03-03 10:39:42,222 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:42,222 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:42,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:39:42,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:42,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774458619]
[2025-03-03 10:39:42,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774458619] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:42,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:42,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:39:42,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630496924]
[2025-03-03 10:39:42,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:42,346 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:42,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:42,346 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:42,347 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:42,347 INFO  L87              Difference]: Start difference. First operand 21032 states and 23987 transitions. Second operand  has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:44,686 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:44,687 INFO  L93              Difference]: Finished difference Result 60086 states and 68807 transitions.
[2025-03-03 10:39:44,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:44,687 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256
[2025-03-03 10:39:44,688 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:44,733 INFO  L225             Difference]: With dead ends: 60086
[2025-03-03 10:39:44,734 INFO  L226             Difference]: Without dead ends: 39056
[2025-03-03 10:39:44,753 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:44,753 INFO  L435           NwaCegarLoop]: 1383 mSDtfsCounter, 668 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2739 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:44,754 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1390 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2739 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-03 10:39:44,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39056 states.
[2025-03-03 10:39:45,044 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39056 to 36052.
[2025-03-03 10:39:45,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36052 states, 36051 states have (on average 1.1352805747413386) internal successors, (40928), 36051 states have internal predecessors, (40928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:45,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36052 states to 36052 states and 40928 transitions.
[2025-03-03 10:39:45,106 INFO  L78                 Accepts]: Start accepts. Automaton has 36052 states and 40928 transitions. Word has length 256
[2025-03-03 10:39:45,106 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:45,106 INFO  L471      AbstractCegarLoop]: Abstraction has 36052 states and 40928 transitions.
[2025-03-03 10:39:45,107 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:45,107 INFO  L276                IsEmpty]: Start isEmpty. Operand 36052 states and 40928 transitions.
[2025-03-03 10:39:45,109 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2025-03-03 10:39:45,109 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:45,109 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:39:45,109 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 10:39:45,109 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:45,109 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:45,110 INFO  L85        PathProgramCache]: Analyzing trace with hash 1584885040, now seen corresponding path program 1 times
[2025-03-03 10:39:45,110 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:45,110 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33690337]
[2025-03-03 10:39:45,110 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:45,110 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:45,128 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes.
[2025-03-03 10:39:45,139 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements.
[2025-03-03 10:39:45,139 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:45,139 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:45,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 139 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-03 10:39:45,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:45,231 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33690337]
[2025-03-03 10:39:45,231 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33690337] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:45,231 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:45,231 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:39:45,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854065833]
[2025-03-03 10:39:45,232 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:45,232 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:45,232 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:45,232 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:45,232 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:45,233 INFO  L87              Difference]: Start difference. First operand 36052 states and 40928 transitions. Second operand  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:47,591 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:47,592 INFO  L93              Difference]: Finished difference Result 84118 states and 96746 transitions.
[2025-03-03 10:39:47,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:47,592 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260
[2025-03-03 10:39:47,593 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:47,650 INFO  L225             Difference]: With dead ends: 84118
[2025-03-03 10:39:47,650 INFO  L226             Difference]: Without dead ends: 48068
[2025-03-03 10:39:47,671 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:47,675 INFO  L435           NwaCegarLoop]: 1295 mSDtfsCounter, 771 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:47,676 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1303 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 10:39:47,710 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48068 states.
[2025-03-03 10:39:48,074 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 46566.
[2025-03-03 10:39:48,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46566 states, 46565 states have (on average 1.1281434553849459) internal successors, (52532), 46565 states have internal predecessors, (52532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:48,151 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46566 states to 46566 states and 52532 transitions.
[2025-03-03 10:39:48,152 INFO  L78                 Accepts]: Start accepts. Automaton has 46566 states and 52532 transitions. Word has length 260
[2025-03-03 10:39:48,152 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:48,152 INFO  L471      AbstractCegarLoop]: Abstraction has 46566 states and 52532 transitions.
[2025-03-03 10:39:48,152 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:48,153 INFO  L276                IsEmpty]: Start isEmpty. Operand 46566 states and 52532 transitions.
[2025-03-03 10:39:48,156 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 287
[2025-03-03 10:39:48,156 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:48,156 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:39:48,156 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 10:39:48,156 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:48,156 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:48,157 INFO  L85        PathProgramCache]: Analyzing trace with hash -657812945, now seen corresponding path program 1 times
[2025-03-03 10:39:48,157 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:48,157 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719801570]
[2025-03-03 10:39:48,157 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:48,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:48,179 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes.
[2025-03-03 10:39:48,194 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements.
[2025-03-03 10:39:48,194 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:48,194 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:48,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 165 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked.
[2025-03-03 10:39:48,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:48,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719801570]
[2025-03-03 10:39:48,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719801570] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:48,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:48,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:39:48,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42346217]
[2025-03-03 10:39:48,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:48,282 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:48,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:48,282 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:48,283 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:48,283 INFO  L87              Difference]: Start difference. First operand 46566 states and 52532 transitions. Second operand  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:50,496 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:50,497 INFO  L93              Difference]: Finished difference Result 116411 states and 132694 transitions.
[2025-03-03 10:39:50,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:50,497 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 286
[2025-03-03 10:39:50,498 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:50,575 INFO  L225             Difference]: With dead ends: 116411
[2025-03-03 10:39:50,576 INFO  L226             Difference]: Without dead ends: 69847
[2025-03-03 10:39:50,612 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:50,613 INFO  L435           NwaCegarLoop]: 1220 mSDtfsCounter, 742 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:50,613 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1228 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-03 10:39:50,655 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69847 states.
[2025-03-03 10:39:51,146 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69847 to 69096.
[2025-03-03 10:39:51,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69096 states, 69095 states have (on average 1.106172660829293) internal successors, (76431), 69095 states have internal predecessors, (76431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:51,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69096 states to 69096 states and 76431 transitions.
[2025-03-03 10:39:51,253 INFO  L78                 Accepts]: Start accepts. Automaton has 69096 states and 76431 transitions. Word has length 286
[2025-03-03 10:39:51,253 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:51,254 INFO  L471      AbstractCegarLoop]: Abstraction has 69096 states and 76431 transitions.
[2025-03-03 10:39:51,254 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:51,254 INFO  L276                IsEmpty]: Start isEmpty. Operand 69096 states and 76431 transitions.
[2025-03-03 10:39:51,256 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 362
[2025-03-03 10:39:51,256 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:51,256 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:39:51,257 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 10:39:51,257 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:51,257 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:51,257 INFO  L85        PathProgramCache]: Analyzing trace with hash 1721071933, now seen corresponding path program 1 times
[2025-03-03 10:39:51,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:51,257 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251329668]
[2025-03-03 10:39:51,257 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:51,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:51,276 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes.
[2025-03-03 10:39:51,288 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements.
[2025-03-03 10:39:51,289 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:51,289 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:51,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 336 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-03-03 10:39:51,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:51,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251329668]
[2025-03-03 10:39:51,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251329668] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:51,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:51,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:39:51,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081486737]
[2025-03-03 10:39:51,393 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:51,393 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:51,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:51,394 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:51,394 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:51,394 INFO  L87              Difference]: Start difference. First operand 69096 states and 76431 transitions. Second operand  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:53,740 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:53,740 INFO  L93              Difference]: Finished difference Result 160720 states and 178910 transitions.
[2025-03-03 10:39:53,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:53,740 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 361
[2025-03-03 10:39:53,741 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:53,840 INFO  L225             Difference]: With dead ends: 160720
[2025-03-03 10:39:53,840 INFO  L226             Difference]: Without dead ends: 91626
[2025-03-03 10:39:53,881 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:53,881 INFO  L435           NwaCegarLoop]: 357 mSDtfsCounter, 745 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:53,882 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 364 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 10:39:53,941 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91626 states.
[2025-03-03 10:39:54,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91626 to 87871.
[2025-03-03 10:39:54,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87871 states, 87870 states have (on average 1.10921816319563) internal successors, (97467), 87870 states have internal predecessors, (97467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:54,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87871 states to 87871 states and 97467 transitions.
[2025-03-03 10:39:54,992 INFO  L78                 Accepts]: Start accepts. Automaton has 87871 states and 97467 transitions. Word has length 361
[2025-03-03 10:39:54,992 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:54,992 INFO  L471      AbstractCegarLoop]: Abstraction has 87871 states and 97467 transitions.
[2025-03-03 10:39:54,992 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:54,992 INFO  L276                IsEmpty]: Start isEmpty. Operand 87871 states and 97467 transitions.
[2025-03-03 10:39:54,997 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 381
[2025-03-03 10:39:54,997 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:54,997 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:39:54,998 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 10:39:54,998 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:54,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:54,998 INFO  L85        PathProgramCache]: Analyzing trace with hash 1362266468, now seen corresponding path program 1 times
[2025-03-03 10:39:54,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:54,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751559830]
[2025-03-03 10:39:54,998 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:54,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:55,031 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes.
[2025-03-03 10:39:55,050 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements.
[2025-03-03 10:39:55,050 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:55,050 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:55,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 371 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked.
[2025-03-03 10:39:55,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:55,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751559830]
[2025-03-03 10:39:55,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751559830] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:55,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:55,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:39:55,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927561436]
[2025-03-03 10:39:55,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:55,223 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:55,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:55,223 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:55,224 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:55,224 INFO  L87              Difference]: Start difference. First operand 87871 states and 97467 transitions. Second operand  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:57,638 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:57,638 INFO  L93              Difference]: Finished difference Result 194515 states and 218292 transitions.
[2025-03-03 10:39:57,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:57,639 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 380
[2025-03-03 10:39:57,639 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:57,771 INFO  L225             Difference]: With dead ends: 194515
[2025-03-03 10:39:57,771 INFO  L226             Difference]: Without dead ends: 106646
[2025-03-03 10:39:57,823 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:57,823 INFO  L435           NwaCegarLoop]: 1288 mSDtfsCounter, 738 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:57,823 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1296 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2253 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 10:39:57,895 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106646 states.
[2025-03-03 10:39:58,855 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106646 to 105895.
[2025-03-03 10:39:58,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105895 states, 105894 states have (on average 1.0968798987666912) internal successors, (116153), 105894 states have internal predecessors, (116153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:59,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105895 states to 105895 states and 116153 transitions.
[2025-03-03 10:39:59,000 INFO  L78                 Accepts]: Start accepts. Automaton has 105895 states and 116153 transitions. Word has length 380
[2025-03-03 10:39:59,001 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:59,001 INFO  L471      AbstractCegarLoop]: Abstraction has 105895 states and 116153 transitions.
[2025-03-03 10:39:59,001 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:39:59,001 INFO  L276                IsEmpty]: Start isEmpty. Operand 105895 states and 116153 transitions.
[2025-03-03 10:39:59,005 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 419
[2025-03-03 10:39:59,005 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:59,006 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:39:59,006 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 10:39:59,006 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:59,006 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:59,006 INFO  L85        PathProgramCache]: Analyzing trace with hash 56133425, now seen corresponding path program 1 times
[2025-03-03 10:39:59,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:59,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772328754]
[2025-03-03 10:39:59,006 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:59,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:59,029 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes.
[2025-03-03 10:39:59,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements.
[2025-03-03 10:39:59,044 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:59,044 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:59,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked.
[2025-03-03 10:39:59,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:59,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772328754]
[2025-03-03 10:39:59,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772328754] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:59,148 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:59,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:39:59,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243727674]
[2025-03-03 10:39:59,149 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:59,149 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:39:59,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:59,149 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:39:59,150 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:39:59,150 INFO  L87              Difference]: Start difference. First operand 105895 states and 116153 transitions. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:01,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:40:01,625 INFO  L93              Difference]: Finished difference Result 212539 states and 233086 transitions.
[2025-03-03 10:40:01,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:40:01,625 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 418
[2025-03-03 10:40:01,626 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:40:01,760 INFO  L225             Difference]: With dead ends: 212539
[2025-03-03 10:40:01,760 INFO  L226             Difference]: Without dead ends: 105895
[2025-03-03 10:40:01,827 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:40:01,828 INFO  L435           NwaCegarLoop]: 1005 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:40:01,828 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1012 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 10:40:01,899 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105895 states.
[2025-03-03 10:40:02,762 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105895 to 102891.
[2025-03-03 10:40:02,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102891 states, 102890 states have (on average 1.079307998833706) internal successors, (111050), 102890 states have internal predecessors, (111050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:02,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102891 states to 102891 states and 111050 transitions.
[2025-03-03 10:40:02,928 INFO  L78                 Accepts]: Start accepts. Automaton has 102891 states and 111050 transitions. Word has length 418
[2025-03-03 10:40:02,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:40:02,928 INFO  L471      AbstractCegarLoop]: Abstraction has 102891 states and 111050 transitions.
[2025-03-03 10:40:02,928 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:02,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 102891 states and 111050 transitions.
[2025-03-03 10:40:02,932 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 427
[2025-03-03 10:40:02,932 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:40:02,933 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 10:40:02,933 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 10:40:02,933 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:40:02,933 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:40:02,934 INFO  L85        PathProgramCache]: Analyzing trace with hash -316600694, now seen corresponding path program 1 times
[2025-03-03 10:40:02,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:40:02,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343775549]
[2025-03-03 10:40:02,934 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:40:02,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:40:02,954 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes.
[2025-03-03 10:40:02,967 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements.
[2025-03-03 10:40:02,968 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:40:02,968 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:40:03,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 558 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-03-03 10:40:03,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:40:03,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343775549]
[2025-03-03 10:40:03,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343775549] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:40:03,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:40:03,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:40:03,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312271520]
[2025-03-03 10:40:03,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:40:03,444 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:40:03,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:40:03,445 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:40:03,445 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:40:03,445 INFO  L87              Difference]: Start difference. First operand 102891 states and 111050 transitions. Second operand  has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:05,628 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:40:05,629 INFO  L93              Difference]: Finished difference Result 222302 states and 239711 transitions.
[2025-03-03 10:40:05,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:40:05,629 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 426
[2025-03-03 10:40:05,629 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:40:05,766 INFO  L225             Difference]: With dead ends: 222302
[2025-03-03 10:40:05,766 INFO  L226             Difference]: Without dead ends: 117911
[2025-03-03 10:40:05,808 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:40:05,808 INFO  L435           NwaCegarLoop]: 931 mSDtfsCounter, 781 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 2723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:40:05,808 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 939 Invalid, 2723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-03 10:40:05,877 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117911 states.
[2025-03-03 10:40:06,832 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117911 to 112654.
[2025-03-03 10:40:06,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112654 states, 112653 states have (on average 1.0721685174828899) internal successors, (120783), 112653 states have internal predecessors, (120783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:07,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112654 states to 112654 states and 120783 transitions.
[2025-03-03 10:40:07,053 INFO  L78                 Accepts]: Start accepts. Automaton has 112654 states and 120783 transitions. Word has length 426
[2025-03-03 10:40:07,053 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:40:07,053 INFO  L471      AbstractCegarLoop]: Abstraction has 112654 states and 120783 transitions.
[2025-03-03 10:40:07,053 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:07,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 112654 states and 120783 transitions.
[2025-03-03 10:40:07,303 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 437
[2025-03-03 10:40:07,304 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:40:07,304 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 10:40:07,304 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 10:40:07,304 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:40:07,304 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:40:07,305 INFO  L85        PathProgramCache]: Analyzing trace with hash -1559499112, now seen corresponding path program 1 times
[2025-03-03 10:40:07,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:40:07,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412841310]
[2025-03-03 10:40:07,305 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:40:07,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:40:07,331 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes.
[2025-03-03 10:40:07,346 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements.
[2025-03-03 10:40:07,347 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:40:07,347 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:40:07,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 452 backedges. 124 proven. 257 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked.
[2025-03-03 10:40:07,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:40:07,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412841310]
[2025-03-03 10:40:07,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412841310] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:40:07,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361445185]
[2025-03-03 10:40:07,695 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:40:07,695 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:40:07,695 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:40:07,697 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:40:07,698 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 10:40:07,744 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes.
[2025-03-03 10:40:07,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements.
[2025-03-03 10:40:07,803 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:40:07,803 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:40:07,805 INFO  L256         TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:40:07,810 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:40:07,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 452 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2025-03-03 10:40:07,955 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:40:07,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361445185] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:40:07,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:40:07,955 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 10:40:07,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324098462]
[2025-03-03 10:40:07,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:40:07,956 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:40:07,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:40:07,956 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:40:07,956 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:40:07,956 INFO  L87              Difference]: Start difference. First operand 112654 states and 120783 transitions. Second operand  has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:10,479 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:40:10,479 INFO  L93              Difference]: Finished difference Result 269615 states and 291056 transitions.
[2025-03-03 10:40:10,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:40:10,480 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 436
[2025-03-03 10:40:10,480 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:40:10,668 INFO  L225             Difference]: With dead ends: 269615
[2025-03-03 10:40:10,668 INFO  L226             Difference]: Without dead ends: 157714
[2025-03-03 10:40:10,756 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:40:10,756 INFO  L435           NwaCegarLoop]: 1281 mSDtfsCounter, 618 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:40:10,756 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1289 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-03 10:40:10,875 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 157714 states.
[2025-03-03 10:40:12,382 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 157714 to 150204.
[2025-03-03 10:40:12,481 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 150204 states, 150203 states have (on average 1.0679347283343208) internal successors, (160407), 150203 states have internal predecessors, (160407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:12,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 150204 states to 150204 states and 160407 transitions.
[2025-03-03 10:40:12,875 INFO  L78                 Accepts]: Start accepts. Automaton has 150204 states and 160407 transitions. Word has length 436
[2025-03-03 10:40:12,875 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:40:12,876 INFO  L471      AbstractCegarLoop]: Abstraction has 150204 states and 160407 transitions.
[2025-03-03 10:40:12,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:12,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 150204 states and 160407 transitions.
[2025-03-03 10:40:12,882 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 528
[2025-03-03 10:40:12,882 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:40:12,882 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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]
[2025-03-03 10:40:12,888 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-03 10:40:13,083 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,SelfDestructingSolverStorable14
[2025-03-03 10:40:13,083 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:40:13,083 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:40:13,084 INFO  L85        PathProgramCache]: Analyzing trace with hash 1312908734, now seen corresponding path program 1 times
[2025-03-03 10:40:13,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:40:13,084 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443098599]
[2025-03-03 10:40:13,084 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:40:13,084 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:40:13,109 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes.
[2025-03-03 10:40:13,126 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements.
[2025-03-03 10:40:13,127 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:40:13,127 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:40:13,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 715 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked.
[2025-03-03 10:40:13,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:40:13,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443098599]
[2025-03-03 10:40:13,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443098599] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:40:13,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:40:13,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:40:13,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442379005]
[2025-03-03 10:40:13,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:40:13,221 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:40:13,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:40:13,221 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:40:13,221 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:40:13,221 INFO  L87              Difference]: Start difference. First operand 150204 states and 160407 transitions. Second operand  has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:15,743 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:40:15,743 INFO  L93              Difference]: Finished difference Result 319181 states and 341031 transitions.
[2025-03-03 10:40:15,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:40:15,746 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 527
[2025-03-03 10:40:15,746 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:40:15,933 INFO  L225             Difference]: With dead ends: 319181
[2025-03-03 10:40:15,933 INFO  L226             Difference]: Without dead ends: 169730
[2025-03-03 10:40:15,981 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:40:15,982 INFO  L435           NwaCegarLoop]: 1109 mSDtfsCounter, 844 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:40:15,982 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1117 Invalid, 2615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-03 10:40:16,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169730 states.
[2025-03-03 10:40:17,520 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169730 to 168979.
[2025-03-03 10:40:17,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 168979 states, 168978 states have (on average 1.0630377919019043) internal successors, (179630), 168978 states have internal predecessors, (179630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:17,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 168979 states to 168979 states and 179630 transitions.
[2025-03-03 10:40:17,817 INFO  L78                 Accepts]: Start accepts. Automaton has 168979 states and 179630 transitions. Word has length 527
[2025-03-03 10:40:17,817 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:40:17,817 INFO  L471      AbstractCegarLoop]: Abstraction has 168979 states and 179630 transitions.
[2025-03-03 10:40:17,817 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:17,817 INFO  L276                IsEmpty]: Start isEmpty. Operand 168979 states and 179630 transitions.
[2025-03-03 10:40:18,092 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 620
[2025-03-03 10:40:18,092 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:40:18,092 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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]
[2025-03-03 10:40:18,093 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 10:40:18,093 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:40:18,093 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:40:18,093 INFO  L85        PathProgramCache]: Analyzing trace with hash -460591106, now seen corresponding path program 1 times
[2025-03-03 10:40:18,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:40:18,093 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477637205]
[2025-03-03 10:40:18,093 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:40:18,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:40:18,122 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes.
[2025-03-03 10:40:18,137 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements.
[2025-03-03 10:40:18,137 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:40:18,137 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:40:18,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 850 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2025-03-03 10:40:18,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:40:18,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477637205]
[2025-03-03 10:40:18,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477637205] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:40:18,618 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:40:18,618 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:40:18,618 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919967595]
[2025-03-03 10:40:18,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:40:18,619 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:40:18,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:40:18,619 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:40:18,619 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:40:18,619 INFO  L87              Difference]: Start difference. First operand 168979 states and 179630 transitions. Second operand  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:21,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:40:21,144 INFO  L93              Difference]: Finished difference Result 345466 states and 366934 transitions.
[2025-03-03 10:40:21,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:40:21,145 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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 619
[2025-03-03 10:40:21,145 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:40:21,381 INFO  L225             Difference]: With dead ends: 345466
[2025-03-03 10:40:21,381 INFO  L226             Difference]: Without dead ends: 177240
[2025-03-03 10:40:21,700 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:40:21,700 INFO  L435           NwaCegarLoop]: 1208 mSDtfsCounter, 592 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:40:21,700 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1215 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-03 10:40:21,775 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 177240 states.
[2025-03-03 10:40:23,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 177240 to 171983.
[2025-03-03 10:40:23,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 171983 states, 171982 states have (on average 1.0589189566349966) internal successors, (182115), 171982 states have internal predecessors, (182115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:23,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 171983 states to 171983 states and 182115 transitions.
[2025-03-03 10:40:23,663 INFO  L78                 Accepts]: Start accepts. Automaton has 171983 states and 182115 transitions. Word has length 619
[2025-03-03 10:40:23,663 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:40:23,663 INFO  L471      AbstractCegarLoop]: Abstraction has 171983 states and 182115 transitions.
[2025-03-03 10:40:23,663 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:23,663 INFO  L276                IsEmpty]: Start isEmpty. Operand 171983 states and 182115 transitions.
[2025-03-03 10:40:23,676 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 657
[2025-03-03 10:40:23,676 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:40:23,676 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-03-03 10:40:23,677 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 10:40:23,677 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:40:23,677 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:40:23,677 INFO  L85        PathProgramCache]: Analyzing trace with hash -1601025146, now seen corresponding path program 1 times
[2025-03-03 10:40:23,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:40:23,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023816653]
[2025-03-03 10:40:23,677 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:40:23,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:40:23,708 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes.
[2025-03-03 10:40:23,723 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements.
[2025-03-03 10:40:23,723 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:40:23,723 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:40:24,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 961 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked.
[2025-03-03 10:40:24,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:40:24,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023816653]
[2025-03-03 10:40:24,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023816653] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:40:24,183 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:40:24,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:40:24,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538935342]
[2025-03-03 10:40:24,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:40:24,184 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:40:24,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:40:24,184 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:40:24,185 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:40:24,185 INFO  L87              Difference]: Start difference. First operand 171983 states and 182115 transitions. Second operand  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:26,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:40:26,657 INFO  L93              Difference]: Finished difference Result 347719 states and 368086 transitions.
[2025-03-03 10:40:26,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:40:26,657 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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 656
[2025-03-03 10:40:26,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:40:26,873 INFO  L225             Difference]: With dead ends: 347719
[2025-03-03 10:40:26,873 INFO  L226             Difference]: Without dead ends: 176489
[2025-03-03 10:40:26,955 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:40:26,955 INFO  L435           NwaCegarLoop]: 1296 mSDtfsCounter, 605 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:40:26,955 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1304 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-03 10:40:27,085 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 176489 states.
[2025-03-03 10:40:28,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 176489 to 170481.
[2025-03-03 10:40:28,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 170481 states, 170480 states have (on average 1.0572207883622713) internal successors, (180235), 170480 states have internal predecessors, (180235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:28,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 170481 states to 170481 states and 180235 transitions.
[2025-03-03 10:40:28,825 INFO  L78                 Accepts]: Start accepts. Automaton has 170481 states and 180235 transitions. Word has length 656
[2025-03-03 10:40:28,826 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:40:28,826 INFO  L471      AbstractCegarLoop]: Abstraction has 170481 states and 180235 transitions.
[2025-03-03 10:40:28,826 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:28,826 INFO  L276                IsEmpty]: Start isEmpty. Operand 170481 states and 180235 transitions.
[2025-03-03 10:40:28,840 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 676
[2025-03-03 10:40:28,840 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:40:28,840 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:40:28,840 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 10:40:28,840 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:40:28,841 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:40:28,841 INFO  L85        PathProgramCache]: Analyzing trace with hash 462007466, now seen corresponding path program 1 times
[2025-03-03 10:40:28,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:40:28,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760800855]
[2025-03-03 10:40:28,841 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:40:28,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:40:28,874 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes.
[2025-03-03 10:40:28,888 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements.
[2025-03-03 10:40:28,888 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:40:28,889 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:40:29,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 1169 backedges. 1029 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2025-03-03 10:40:29,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:40:29,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760800855]
[2025-03-03 10:40:29,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760800855] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:40:29,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:40:29,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:40:29,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400624514]
[2025-03-03 10:40:29,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:40:29,479 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:40:29,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:40:29,479 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:40:29,479 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:40:29,480 INFO  L87              Difference]: Start difference. First operand 170481 states and 180235 transitions. Second operand  has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:32,941 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:40:32,941 INFO  L93              Difference]: Finished difference Result 346217 states and 365936 transitions.
[2025-03-03 10:40:32,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:40:32,941 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 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 675
[2025-03-03 10:40:32,942 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:40:33,128 INFO  L225             Difference]: With dead ends: 346217
[2025-03-03 10:40:33,128 INFO  L226             Difference]: Without dead ends: 175738
[2025-03-03 10:40:33,214 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:40:33,215 INFO  L435           NwaCegarLoop]: 1322 mSDtfsCounter, 1308 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5435 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 5611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 5435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:40:33,215 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1344 Invalid, 5611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 5435 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-03-03 10:40:33,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 175738 states.
[2025-03-03 10:40:34,865 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 175738 to 175738.
[2025-03-03 10:40:34,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175738 states, 175737 states have (on average 1.054547420292824) internal successors, (185323), 175737 states have internal predecessors, (185323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:35,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175738 states to 175738 states and 185323 transitions.
[2025-03-03 10:40:35,177 INFO  L78                 Accepts]: Start accepts. Automaton has 175738 states and 185323 transitions. Word has length 675
[2025-03-03 10:40:35,178 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:40:35,178 INFO  L471      AbstractCegarLoop]: Abstraction has 175738 states and 185323 transitions.
[2025-03-03 10:40:35,178 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:40:35,178 INFO  L276                IsEmpty]: Start isEmpty. Operand 175738 states and 185323 transitions.
[2025-03-03 10:40:35,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 689
[2025-03-03 10:40:35,195 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:40:35,196 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:40:35,196 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 10:40:35,196 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:40:35,196 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:40:35,196 INFO  L85        PathProgramCache]: Analyzing trace with hash 1913293778, now seen corresponding path program 1 times
[2025-03-03 10:40:35,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:40:35,196 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810606942]
[2025-03-03 10:40:35,196 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:40:35,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:40:35,251 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes.
[2025-03-03 10:40:35,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements.
[2025-03-03 10:40:35,283 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:40:35,283 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat