./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label19.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/Problem02_label19.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 eadd63632d128e63354140f48e358b613932fbd540e74b83f7baa2b6412d6e8f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:49:01,775 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:49:01,829 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 09:49:01,833 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:49:01,833 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:49:01,851 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:49:01,853 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:49:01,853 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:49:01,853 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:49:01,854 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:49:01,854 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:49:01,854 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:49:01,855 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:49:01,855 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:49:01,855 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:49:01,855 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:49:01,855 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:49:01,855 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:49:01,856 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:49:01,856 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:49:01,857 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:49:01,857 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:49:01,857 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:49:01,857 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:49:01,857 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:49:01,857 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:49:01,857 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:49:01,857 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 09:49:01,857 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 09:49:01,858 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:49:01,858 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:49:01,858 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:49:01,858 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:49:01,858 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 -> eadd63632d128e63354140f48e358b613932fbd540e74b83f7baa2b6412d6e8f
[2025-03-03 09:49:02,072 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:49:02,077 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:49:02,079 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:49:02,080 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:49:02,080 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:49:02,081 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label19.c
[2025-03-03 09:49:03,172 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da893d34f/4c56fefa9e8045afbcb6f7f7459169a9/FLAGfcbf49192
[2025-03-03 09:49:03,415 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:49:03,416 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label19.c
[2025-03-03 09:49:03,436 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da893d34f/4c56fefa9e8045afbcb6f7f7459169a9/FLAGfcbf49192
[2025-03-03 09:49:03,741 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da893d34f/4c56fefa9e8045afbcb6f7f7459169a9
[2025-03-03 09:49:03,743 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:49:03,744 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:49:03,745 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:49:03,745 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:49:03,747 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:49:03,748 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:03" (1/1) ...
[2025-03-03 09:49:03,749 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d7865d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:03, skipping insertion in model container
[2025-03-03 09:49:03,749 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:03" (1/1) ...
[2025-03-03 09:49:03,779 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:49:03,976 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/Problem02_label19.c[15877,15890]
[2025-03-03 09:49:04,014 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:49:04,021 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:49:04,124 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/Problem02_label19.c[15877,15890]
[2025-03-03 09:49:04,156 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:49:04,166 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:49:04,167 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04 WrapperNode
[2025-03-03 09:49:04,167 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:49:04,168 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:49:04,168 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:49:04,168 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:49:04,172 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,184 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,210 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666
[2025-03-03 09:49:04,211 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:49:04,211 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:49:04,212 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:49:04,212 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:49:04,219 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,220 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,222 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,242 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 09:49:04,246 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,247 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,266 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,268 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,274 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,276 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,280 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:49:04,282 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:49:04,283 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:49:04,283 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:49:04,284 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (1/1) ...
[2025-03-03 09:49:04,288 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:49:04,297 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:49:04,309 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 09:49:04,312 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 09:49:04,330 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:49:04,331 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:49:04,331 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:49:04,331 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:49:04,386 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:49:04,387 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:49:05,059 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2025-03-03 09:49:05,059 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:49:05,070 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:49:05,071 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:49:05,071 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:05 BoogieIcfgContainer
[2025-03-03 09:49:05,071 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:49:05,073 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:49:05,073 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:49:05,076 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:49:05,076 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:49:03" (1/3) ...
[2025-03-03 09:49:05,076 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdb188f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:05, skipping insertion in model container
[2025-03-03 09:49:05,077 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:04" (2/3) ...
[2025-03-03 09:49:05,077 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdb188f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:05, skipping insertion in model container
[2025-03-03 09:49:05,077 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:05" (3/3) ...
[2025-03-03 09:49:05,078 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem02_label19.c
[2025-03-03 09:49:05,088 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:49:05,089 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label19.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:49:05,135 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:49:05,145 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;@78b8df01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:49:05,146 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:49:05,150 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 09:49:05,157 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-03-03 09:49:05,158 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:05,158 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:05,159 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:05,163 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:05,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -893192710, now seen corresponding path program 1 times
[2025-03-03 09:49:05,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:05,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382826387]
[2025-03-03 09:49:05,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:05,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:05,229 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-03-03 09:49:05,294 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-03-03 09:49:05,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:05,294 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:05,597 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 09:49:05,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:05,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382826387]
[2025-03-03 09:49:05,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382826387] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:05,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:05,601 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:05,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593855163]
[2025-03-03 09:49:05,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:05,605 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:05,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:05,617 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:05,618 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:05,620 INFO  L87              Difference]: Start difference. First operand  has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 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 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 09:49:06,172 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:06,173 INFO  L93              Difference]: Finished difference Result 639 states and 1079 transitions.
[2025-03-03 09:49:06,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:06,175 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92
[2025-03-03 09:49:06,175 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:06,181 INFO  L225             Difference]: With dead ends: 639
[2025-03-03 09:49:06,181 INFO  L226             Difference]: Without dead ends: 318
[2025-03-03 09:49:06,184 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 09:49:06,185 INFO  L435           NwaCegarLoop]: 105 mSDtfsCounter, 117 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:06,186 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 136 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:49:06,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-03-03 09:49:06,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313.
[2025-03-03 09:49:06,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 313 states, 312 states have (on average 1.4711538461538463) internal successors, (459), 312 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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 09:49:06,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 459 transitions.
[2025-03-03 09:49:06,232 INFO  L78                 Accepts]: Start accepts. Automaton has 313 states and 459 transitions. Word has length 92
[2025-03-03 09:49:06,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:06,232 INFO  L471      AbstractCegarLoop]: Abstraction has 313 states and 459 transitions.
[2025-03-03 09:49:06,233 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 09:49:06,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 313 states and 459 transitions.
[2025-03-03 09:49:06,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2025-03-03 09:49:06,235 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:06,235 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 09:49:06,235 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:49:06,235 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:06,236 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:06,236 INFO  L85        PathProgramCache]: Analyzing trace with hash 1232020317, now seen corresponding path program 1 times
[2025-03-03 09:49:06,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:06,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255480023]
[2025-03-03 09:49:06,236 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:06,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:06,252 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-03-03 09:49:06,267 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-03-03 09:49:06,267 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:06,267 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:06,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:06,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:06,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255480023]
[2025-03-03 09:49:06,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255480023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:06,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:06,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:06,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876276869]
[2025-03-03 09:49:06,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:06,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:49:06,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:06,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:49:06,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:49:06,554 INFO  L87              Difference]: Start difference. First operand 313 states and 459 transitions. Second operand  has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 09:49:07,123 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:07,123 INFO  L93              Difference]: Finished difference Result 989 states and 1492 transitions.
[2025-03-03 09:49:07,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:49:07,123 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96
[2025-03-03 09:49:07,124 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:07,126 INFO  L225             Difference]: With dead ends: 989
[2025-03-03 09:49:07,126 INFO  L226             Difference]: Without dead ends: 595
[2025-03-03 09:49:07,127 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 09:49:07,127 INFO  L435           NwaCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:07,128 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 107 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:49:07,128 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 595 states.
[2025-03-03 09:49:07,143 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595.
[2025-03-03 09:49:07,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 595 states, 594 states have (on average 1.3383838383838385) internal successors, (795), 594 states have internal predecessors, (795), 0 states have call successors, (0), 0 states 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 09:49:07,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 795 transitions.
[2025-03-03 09:49:07,145 INFO  L78                 Accepts]: Start accepts. Automaton has 595 states and 795 transitions. Word has length 96
[2025-03-03 09:49:07,145 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:07,145 INFO  L471      AbstractCegarLoop]: Abstraction has 595 states and 795 transitions.
[2025-03-03 09:49:07,145 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 09:49:07,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 595 states and 795 transitions.
[2025-03-03 09:49:07,148 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-03-03 09:49:07,148 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:07,149 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:07,149 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:49:07,149 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:07,149 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:07,149 INFO  L85        PathProgramCache]: Analyzing trace with hash 716326404, now seen corresponding path program 1 times
[2025-03-03 09:49:07,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:07,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309558289]
[2025-03-03 09:49:07,149 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:07,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:07,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-03-03 09:49:07,178 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-03-03 09:49:07,178 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:07,178 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:07,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:49:07,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:07,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309558289]
[2025-03-03 09:49:07,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309558289] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:07,275 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:07,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:07,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563180020]
[2025-03-03 09:49:07,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:07,276 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:07,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:07,277 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:07,277 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:07,278 INFO  L87              Difference]: Start difference. First operand 595 states and 795 transitions. Second operand  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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 09:49:07,661 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:07,661 INFO  L93              Difference]: Finished difference Result 1753 states and 2346 transitions.
[2025-03-03 09:49:07,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:07,661 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 122
[2025-03-03 09:49:07,662 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:07,665 INFO  L225             Difference]: With dead ends: 1753
[2025-03-03 09:49:07,665 INFO  L226             Difference]: Without dead ends: 1160
[2025-03-03 09:49:07,667 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 09:49:07,667 INFO  L435           NwaCegarLoop]: 110 mSDtfsCounter, 126 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:07,667 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 127 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:49:07,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1160 states.
[2025-03-03 09:49:07,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1157.
[2025-03-03 09:49:07,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1157 states, 1156 states have (on average 1.2093425605536332) internal successors, (1398), 1156 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states 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 09:49:07,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1398 transitions.
[2025-03-03 09:49:07,695 INFO  L78                 Accepts]: Start accepts. Automaton has 1157 states and 1398 transitions. Word has length 122
[2025-03-03 09:49:07,696 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:07,696 INFO  L471      AbstractCegarLoop]: Abstraction has 1157 states and 1398 transitions.
[2025-03-03 09:49:07,696 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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 09:49:07,696 INFO  L276                IsEmpty]: Start isEmpty. Operand 1157 states and 1398 transitions.
[2025-03-03 09:49:07,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-03-03 09:49:07,700 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:07,700 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:07,701 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:49:07,701 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:07,701 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:07,701 INFO  L85        PathProgramCache]: Analyzing trace with hash 237107801, now seen corresponding path program 1 times
[2025-03-03 09:49:07,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:07,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639984112]
[2025-03-03 09:49:07,701 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:07,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:07,725 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-03 09:49:07,733 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-03 09:49:07,733 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:07,733 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:07,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:07,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:07,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639984112]
[2025-03-03 09:49:07,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639984112] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:07,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:07,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:49:07,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498456]
[2025-03-03 09:49:07,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:07,918 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:49:07,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:07,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:49:07,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:49:07,919 INFO  L87              Difference]: Start difference. First operand 1157 states and 1398 transitions. Second operand  has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:08,531 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:08,532 INFO  L93              Difference]: Finished difference Result 2452 states and 2968 transitions.
[2025-03-03 09:49:08,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:49:08,532 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125
[2025-03-03 09:49:08,532 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:08,536 INFO  L225             Difference]: With dead ends: 2452
[2025-03-03 09:49:08,536 INFO  L226             Difference]: Without dead ends: 1297
[2025-03-03 09:49:08,537 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:49:08,538 INFO  L435           NwaCegarLoop]: 83 mSDtfsCounter, 346 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:08,538 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 148 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:49:08,540 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1297 states.
[2025-03-03 09:49:08,554 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297.
[2025-03-03 09:49:08,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1297 states, 1296 states have (on average 1.1905864197530864) internal successors, (1543), 1296 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states 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 09:49:08,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1543 transitions.
[2025-03-03 09:49:08,559 INFO  L78                 Accepts]: Start accepts. Automaton has 1297 states and 1543 transitions. Word has length 125
[2025-03-03 09:49:08,559 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:08,559 INFO  L471      AbstractCegarLoop]: Abstraction has 1297 states and 1543 transitions.
[2025-03-03 09:49:08,559 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:08,560 INFO  L276                IsEmpty]: Start isEmpty. Operand 1297 states and 1543 transitions.
[2025-03-03 09:49:08,572 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-03-03 09:49:08,572 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:08,572 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:08,572 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:49:08,572 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:08,573 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:08,573 INFO  L85        PathProgramCache]: Analyzing trace with hash -1493859706, now seen corresponding path program 1 times
[2025-03-03 09:49:08,573 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:08,573 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809308314]
[2025-03-03 09:49:08,573 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:08,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:08,594 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-03 09:49:08,602 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-03 09:49:08,602 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:08,602 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:08,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 09:49:08,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:08,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809308314]
[2025-03-03 09:49:08,664 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809308314] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:08,664 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:08,664 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:08,665 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272850692]
[2025-03-03 09:49:08,665 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:08,665 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:08,665 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:08,665 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:08,665 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:08,666 INFO  L87              Difference]: Start difference. First operand 1297 states and 1543 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 09:49:08,992 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:08,992 INFO  L93              Difference]: Finished difference Result 3013 states and 3653 transitions.
[2025-03-03 09:49:08,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:08,993 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 125
[2025-03-03 09:49:08,993 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:08,997 INFO  L225             Difference]: With dead ends: 3013
[2025-03-03 09:49:08,997 INFO  L226             Difference]: Without dead ends: 1573
[2025-03-03 09:49:08,998 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 09:49:08,999 INFO  L435           NwaCegarLoop]: 250 mSDtfsCounter, 140 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:08,999 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 273 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:09,000 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1573 states.
[2025-03-03 09:49:09,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1433.
[2025-03-03 09:49:09,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1433 states, 1432 states have (on average 1.1662011173184357) internal successors, (1670), 1432 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states 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 09:49:09,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1670 transitions.
[2025-03-03 09:49:09,017 INFO  L78                 Accepts]: Start accepts. Automaton has 1433 states and 1670 transitions. Word has length 125
[2025-03-03 09:49:09,017 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:09,017 INFO  L471      AbstractCegarLoop]: Abstraction has 1433 states and 1670 transitions.
[2025-03-03 09:49:09,018 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 09:49:09,018 INFO  L276                IsEmpty]: Start isEmpty. Operand 1433 states and 1670 transitions.
[2025-03-03 09:49:09,019 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2025-03-03 09:49:09,019 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:09,019 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:09,020 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:49:09,020 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:09,020 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:09,020 INFO  L85        PathProgramCache]: Analyzing trace with hash 1590427860, now seen corresponding path program 1 times
[2025-03-03 09:49:09,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:09,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007209781]
[2025-03-03 09:49:09,020 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:09,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:09,032 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes.
[2025-03-03 09:49:09,038 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements.
[2025-03-03 09:49:09,038 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:09,038 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:09,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:09,095 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:09,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007209781]
[2025-03-03 09:49:09,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007209781] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:09,095 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:09,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:09,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038377697]
[2025-03-03 09:49:09,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:09,095 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:09,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:09,096 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:09,096 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:09,096 INFO  L87              Difference]: Start difference. First operand 1433 states and 1670 transitions. Second operand  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 09:49:09,423 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:09,424 INFO  L93              Difference]: Finished difference Result 3282 states and 3834 transitions.
[2025-03-03 09:49:09,424 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:09,424 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128
[2025-03-03 09:49:09,424 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:09,429 INFO  L225             Difference]: With dead ends: 3282
[2025-03-03 09:49:09,429 INFO  L226             Difference]: Without dead ends: 1851
[2025-03-03 09:49:09,430 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 09:49:09,431 INFO  L435           NwaCegarLoop]: 40 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:09,431 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 47 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:09,432 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1851 states.
[2025-03-03 09:49:09,451 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1710.
[2025-03-03 09:49:09,452 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1710 states, 1709 states have (on average 1.1679344645991807) internal successors, (1996), 1709 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states 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 09:49:09,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 1996 transitions.
[2025-03-03 09:49:09,456 INFO  L78                 Accepts]: Start accepts. Automaton has 1710 states and 1996 transitions. Word has length 128
[2025-03-03 09:49:09,456 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:09,456 INFO  L471      AbstractCegarLoop]: Abstraction has 1710 states and 1996 transitions.
[2025-03-03 09:49:09,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 09:49:09,457 INFO  L276                IsEmpty]: Start isEmpty. Operand 1710 states and 1996 transitions.
[2025-03-03 09:49:09,458 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-03 09:49:09,458 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:09,458 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:09,458 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 09:49:09,459 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:09,459 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:09,459 INFO  L85        PathProgramCache]: Analyzing trace with hash 368112240, now seen corresponding path program 1 times
[2025-03-03 09:49:09,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:09,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287714231]
[2025-03-03 09:49:09,459 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:09,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:09,473 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-03 09:49:09,477 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-03 09:49:09,477 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:09,478 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:09,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:49:09,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:09,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287714231]
[2025-03-03 09:49:09,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287714231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:09,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:09,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:49:09,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307003410]
[2025-03-03 09:49:09,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:09,604 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:49:09,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:09,604 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:49:09,604 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:49:09,604 INFO  L87              Difference]: Start difference. First operand 1710 states and 1996 transitions. Second operand  has 5 states, 5 states have (on average 28.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 09:49:10,230 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:10,230 INFO  L93              Difference]: Finished difference Result 3698 states and 4313 transitions.
[2025-03-03 09:49:10,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:49:10,231 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 28.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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 145
[2025-03-03 09:49:10,231 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:10,235 INFO  L225             Difference]: With dead ends: 3698
[2025-03-03 09:49:10,235 INFO  L226             Difference]: Without dead ends: 1710
[2025-03-03 09:49:10,238 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:49:10,238 INFO  L435           NwaCegarLoop]: 82 mSDtfsCounter, 331 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:10,238 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 152 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:49:10,240 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1710 states.
[2025-03-03 09:49:10,262 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1710.
[2025-03-03 09:49:10,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1710 states, 1709 states have (on average 1.131070801638385) internal successors, (1933), 1709 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states 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 09:49:10,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 1933 transitions.
[2025-03-03 09:49:10,268 INFO  L78                 Accepts]: Start accepts. Automaton has 1710 states and 1933 transitions. Word has length 145
[2025-03-03 09:49:10,268 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:10,268 INFO  L471      AbstractCegarLoop]: Abstraction has 1710 states and 1933 transitions.
[2025-03-03 09:49:10,268 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 28.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 09:49:10,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 1710 states and 1933 transitions.
[2025-03-03 09:49:10,270 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-03-03 09:49:10,270 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:10,270 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:49:10,270 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 09:49:10,271 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:10,271 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:10,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 633057199, now seen corresponding path program 1 times
[2025-03-03 09:49:10,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:10,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004720783]
[2025-03-03 09:49:10,271 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:10,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:10,290 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes.
[2025-03-03 09:49:10,296 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements.
[2025-03-03 09:49:10,296 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:10,296 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:10,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:10,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:10,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004720783]
[2025-03-03 09:49:10,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004720783] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:10,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:10,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:10,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638402211]
[2025-03-03 09:49:10,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:10,347 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:10,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:10,347 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:10,347 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:10,347 INFO  L87              Difference]: Start difference. First operand 1710 states and 1933 transitions. Second operand  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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 09:49:10,673 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:10,674 INFO  L93              Difference]: Finished difference Result 3981 states and 4534 transitions.
[2025-03-03 09:49:10,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:10,674 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154
[2025-03-03 09:49:10,675 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:10,681 INFO  L225             Difference]: With dead ends: 3981
[2025-03-03 09:49:10,681 INFO  L226             Difference]: Without dead ends: 2130
[2025-03-03 09:49:10,682 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 09:49:10,683 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 134 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:10,683 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 213 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:10,685 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2130 states.
[2025-03-03 09:49:10,707 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2129.
[2025-03-03 09:49:10,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2129 states, 2128 states have (on average 1.1099624060150375) internal successors, (2362), 2128 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states 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 09:49:10,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2362 transitions.
[2025-03-03 09:49:10,715 INFO  L78                 Accepts]: Start accepts. Automaton has 2129 states and 2362 transitions. Word has length 154
[2025-03-03 09:49:10,716 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:10,716 INFO  L471      AbstractCegarLoop]: Abstraction has 2129 states and 2362 transitions.
[2025-03-03 09:49:10,716 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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 09:49:10,716 INFO  L276                IsEmpty]: Start isEmpty. Operand 2129 states and 2362 transitions.
[2025-03-03 09:49:10,719 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 09:49:10,719 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:10,719 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:10,721 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 09:49:10,721 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:10,722 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:10,722 INFO  L85        PathProgramCache]: Analyzing trace with hash -697182320, now seen corresponding path program 1 times
[2025-03-03 09:49:10,722 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:10,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651950819]
[2025-03-03 09:49:10,722 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:10,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:10,741 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 09:49:10,748 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 09:49:10,748 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:10,749 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:10,797 INFO  L134       CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:49:10,797 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:10,797 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651950819]
[2025-03-03 09:49:10,797 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651950819] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:10,797 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:10,797 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:10,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798997675]
[2025-03-03 09:49:10,797 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:10,798 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:10,798 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:10,798 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:10,798 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:10,798 INFO  L87              Difference]: Start difference. First operand 2129 states and 2362 transitions. Second operand  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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 09:49:11,088 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:11,088 INFO  L93              Difference]: Finished difference Result 4810 states and 5312 transitions.
[2025-03-03 09:49:11,089 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:11,089 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170
[2025-03-03 09:49:11,089 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:11,096 INFO  L225             Difference]: With dead ends: 4810
[2025-03-03 09:49:11,096 INFO  L226             Difference]: Without dead ends: 2683
[2025-03-03 09:49:11,099 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 09:49:11,102 INFO  L435           NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:11,103 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 35 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:11,105 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2683 states.
[2025-03-03 09:49:11,134 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2403.
[2025-03-03 09:49:11,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2403 states, 2402 states have (on average 1.0882597835137386) internal successors, (2614), 2402 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states 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 09:49:11,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 2614 transitions.
[2025-03-03 09:49:11,141 INFO  L78                 Accepts]: Start accepts. Automaton has 2403 states and 2614 transitions. Word has length 170
[2025-03-03 09:49:11,142 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:11,142 INFO  L471      AbstractCegarLoop]: Abstraction has 2403 states and 2614 transitions.
[2025-03-03 09:49:11,142 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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 09:49:11,142 INFO  L276                IsEmpty]: Start isEmpty. Operand 2403 states and 2614 transitions.
[2025-03-03 09:49:11,144 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 194
[2025-03-03 09:49:11,145 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:11,145 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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]
[2025-03-03 09:49:11,145 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 09:49:11,145 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:11,146 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:11,147 INFO  L85        PathProgramCache]: Analyzing trace with hash 1454130937, now seen corresponding path program 1 times
[2025-03-03 09:49:11,148 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:11,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66024333]
[2025-03-03 09:49:11,148 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:11,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:11,178 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes.
[2025-03-03 09:49:11,186 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements.
[2025-03-03 09:49:11,186 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:11,186 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:11,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2025-03-03 09:49:11,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:11,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66024333]
[2025-03-03 09:49:11,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66024333] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:11,261 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:11,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:11,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402497150]
[2025-03-03 09:49:11,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:11,261 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:11,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:11,262 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:11,262 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:11,262 INFO  L87              Difference]: Start difference. First operand 2403 states and 2614 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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 09:49:11,510 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:11,511 INFO  L93              Difference]: Finished difference Result 2405 states and 2615 transitions.
[2025-03-03 09:49:11,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:11,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 193
[2025-03-03 09:49:11,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:11,517 INFO  L225             Difference]: With dead ends: 2405
[2025-03-03 09:49:11,518 INFO  L226             Difference]: Without dead ends: 2403
[2025-03-03 09:49:11,518 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 09:49:11,519 INFO  L435           NwaCegarLoop]: 24 mSDtfsCounter, 97 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:11,519 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 29 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:49:11,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2403 states.
[2025-03-03 09:49:11,543 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1983.
[2025-03-03 09:49:11,545 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1983 states, 1982 states have (on average 1.0958627648839556) internal successors, (2172), 1982 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states 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 09:49:11,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2172 transitions.
[2025-03-03 09:49:11,548 INFO  L78                 Accepts]: Start accepts. Automaton has 1983 states and 2172 transitions. Word has length 193
[2025-03-03 09:49:11,549 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:11,549 INFO  L471      AbstractCegarLoop]: Abstraction has 1983 states and 2172 transitions.
[2025-03-03 09:49:11,549 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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 09:49:11,549 INFO  L276                IsEmpty]: Start isEmpty. Operand 1983 states and 2172 transitions.
[2025-03-03 09:49:11,551 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-03 09:49:11,551 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:11,552 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:11,552 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 09:49:11,552 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:11,552 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:11,552 INFO  L85        PathProgramCache]: Analyzing trace with hash 1043576418, now seen corresponding path program 1 times
[2025-03-03 09:49:11,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:11,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815277101]
[2025-03-03 09:49:11,553 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:11,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:11,571 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-03 09:49:11,586 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-03 09:49:11,586 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:11,586 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:11,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 231 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2025-03-03 09:49:11,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:11,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815277101]
[2025-03-03 09:49:11,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815277101] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:11,695 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:11,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:11,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820011298]
[2025-03-03 09:49:11,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:11,696 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:11,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:11,696 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:11,696 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:11,697 INFO  L87              Difference]: Start difference. First operand 1983 states and 2172 transitions. Second operand  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:11,971 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:11,972 INFO  L93              Difference]: Finished difference Result 4244 states and 4648 transitions.
[2025-03-03 09:49:11,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:11,972 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212
[2025-03-03 09:49:11,973 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:11,978 INFO  L225             Difference]: With dead ends: 4244
[2025-03-03 09:49:11,978 INFO  L226             Difference]: Without dead ends: 2123
[2025-03-03 09:49:11,980 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 09:49:11,980 INFO  L435           NwaCegarLoop]: 193 mSDtfsCounter, 139 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:11,980 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 204 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:11,982 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2123 states.
[2025-03-03 09:49:12,010 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2123.
[2025-03-03 09:49:12,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2123 states, 2122 states have (on average 1.079641847313855) internal successors, (2291), 2122 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states 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 09:49:12,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2291 transitions.
[2025-03-03 09:49:12,016 INFO  L78                 Accepts]: Start accepts. Automaton has 2123 states and 2291 transitions. Word has length 212
[2025-03-03 09:49:12,016 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:12,016 INFO  L471      AbstractCegarLoop]: Abstraction has 2123 states and 2291 transitions.
[2025-03-03 09:49:12,016 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:12,016 INFO  L276                IsEmpty]: Start isEmpty. Operand 2123 states and 2291 transitions.
[2025-03-03 09:49:12,019 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-03 09:49:12,019 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:12,019 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:12,019 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 09:49:12,019 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:12,020 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:12,020 INFO  L85        PathProgramCache]: Analyzing trace with hash 657100906, now seen corresponding path program 1 times
[2025-03-03 09:49:12,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:12,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904339747]
[2025-03-03 09:49:12,020 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:12,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:12,042 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-03 09:49:12,051 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-03 09:49:12,051 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:12,051 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:12,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 235 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2025-03-03 09:49:12,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:12,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904339747]
[2025-03-03 09:49:12,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904339747] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:12,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:12,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:12,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997131135]
[2025-03-03 09:49:12,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:12,110 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:12,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:12,110 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:12,110 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:12,110 INFO  L87              Difference]: Start difference. First operand 2123 states and 2291 transitions. Second operand  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 09:49:12,390 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:12,390 INFO  L93              Difference]: Finished difference Result 4244 states and 4569 transitions.
[2025-03-03 09:49:12,391 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:12,391 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 215
[2025-03-03 09:49:12,391 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:12,396 INFO  L225             Difference]: With dead ends: 4244
[2025-03-03 09:49:12,396 INFO  L226             Difference]: Without dead ends: 1982
[2025-03-03 09:49:12,398 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 09:49:12,399 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 143 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:12,399 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 57 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:12,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1982 states.
[2025-03-03 09:49:12,420 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1842.
[2025-03-03 09:49:12,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1842 states, 1841 states have (on average 1.0619228680065183) internal successors, (1955), 1841 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states 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 09:49:12,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 1955 transitions.
[2025-03-03 09:49:12,426 INFO  L78                 Accepts]: Start accepts. Automaton has 1842 states and 1955 transitions. Word has length 215
[2025-03-03 09:49:12,426 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:12,426 INFO  L471      AbstractCegarLoop]: Abstraction has 1842 states and 1955 transitions.
[2025-03-03 09:49:12,426 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 09:49:12,426 INFO  L276                IsEmpty]: Start isEmpty. Operand 1842 states and 1955 transitions.
[2025-03-03 09:49:12,428 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 218
[2025-03-03 09:49:12,428 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:12,429 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, 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, 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 09:49:12,429 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 09:49:12,429 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:12,429 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:12,429 INFO  L85        PathProgramCache]: Analyzing trace with hash 1660612584, now seen corresponding path program 1 times
[2025-03-03 09:49:12,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:12,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257111698]
[2025-03-03 09:49:12,430 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:12,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:12,447 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes.
[2025-03-03 09:49:12,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements.
[2025-03-03 09:49:12,454 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:12,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:12,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 196 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-03-03 09:49:12,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:12,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257111698]
[2025-03-03 09:49:12,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257111698] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:12,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:12,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:12,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273636707]
[2025-03-03 09:49:12,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:12,514 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:12,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:12,514 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:12,514 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:12,514 INFO  L87              Difference]: Start difference. First operand 1842 states and 1955 transitions. Second operand  has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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 09:49:12,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:12,769 INFO  L93              Difference]: Finished difference Result 4104 states and 4348 transitions.
[2025-03-03 09:49:12,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:12,770 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217
[2025-03-03 09:49:12,770 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:12,774 INFO  L225             Difference]: With dead ends: 4104
[2025-03-03 09:49:12,774 INFO  L226             Difference]: Without dead ends: 1981
[2025-03-03 09:49:12,776 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 09:49:12,776 INFO  L435           NwaCegarLoop]: 196 mSDtfsCounter, 89 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:12,776 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 214 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:49:12,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1981 states.
[2025-03-03 09:49:12,793 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1980.
[2025-03-03 09:49:12,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1980 states, 1979 states have (on average 1.0439615967660434) internal successors, (2066), 1979 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states 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 09:49:12,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 2066 transitions.
[2025-03-03 09:49:12,798 INFO  L78                 Accepts]: Start accepts. Automaton has 1980 states and 2066 transitions. Word has length 217
[2025-03-03 09:49:12,798 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:12,798 INFO  L471      AbstractCegarLoop]: Abstraction has 1980 states and 2066 transitions.
[2025-03-03 09:49:12,798 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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 09:49:12,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 1980 states and 2066 transitions.
[2025-03-03 09:49:12,800 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2025-03-03 09:49:12,800 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:12,801 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:49:12,801 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 09:49:12,801 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:12,801 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:12,801 INFO  L85        PathProgramCache]: Analyzing trace with hash -1321810950, now seen corresponding path program 1 times
[2025-03-03 09:49:12,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:12,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555758398]
[2025-03-03 09:49:12,801 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:12,802 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:12,822 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-03-03 09:49:12,833 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-03-03 09:49:12,833 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:12,833 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:13,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 236 backedges. 150 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:13,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:13,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555758398]
[2025-03-03 09:49:13,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555758398] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:49:13,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101896476]
[2025-03-03 09:49:13,080 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:13,080 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:49:13,080 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:49:13,082 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 09:49:13,084 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 09:49:13,130 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-03-03 09:49:13,169 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-03-03 09:49:13,169 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:13,169 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:13,171 INFO  L256         TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:49:13,176 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:49:13,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 236 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked.
[2025-03-03 09:49:13,288 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:49:13,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [101896476] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:13,288 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:49:13,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-03-03 09:49:13,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506567419]
[2025-03-03 09:49:13,288 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:13,288 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:13,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:13,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:13,289 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:49:13,289 INFO  L87              Difference]: Start difference. First operand 1980 states and 2066 transitions. Second operand  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:13,554 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:13,554 INFO  L93              Difference]: Finished difference Result 3956 states and 4131 transitions.
[2025-03-03 09:49:13,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:13,555 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222
[2025-03-03 09:49:13,555 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:13,555 INFO  L225             Difference]: With dead ends: 3956
[2025-03-03 09:49:13,555 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 09:49:13,557 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:49:13,558 INFO  L435           NwaCegarLoop]: 191 mSDtfsCounter, 53 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:13,558 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 205 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:49:13,558 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 09:49:13,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 09:49:13,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:13,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 09:49:13,558 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 222
[2025-03-03 09:49:13,558 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:13,558 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 09:49:13,559 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:13,559 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 09:49:13,559 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 09:49:13,560 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 09:49:13,568 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 09:49:13,761 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-03-03 09:49:13,763 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:13,765 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-03 09:49:14,000 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 09:49:14,011 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:49:14 BoogieIcfgContainer
[2025-03-03 09:49:14,011 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 09:49:14,012 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 09:49:14,012 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 09:49:14,012 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 09:49:14,013 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:05" (3/4) ...
[2025-03-03 09:49:14,014 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-03 09:49:14,030 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-03 09:49:14,031 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-03 09:49:14,032 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-03 09:49:14,032 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-03 09:49:14,129 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 09:49:14,129 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 09:49:14,129 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 09:49:14,130 INFO  L158              Benchmark]: Toolchain (without parser) took 10385.98ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 109.4MB in the beginning and 141.6MB in the end (delta: -32.2MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB.
[2025-03-03 09:49:14,130 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 123.4MB in the beginning and 123.1MB in the end (delta: 294.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:49:14,130 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 422.68ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 83.6MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-03 09:49:14,130 INFO  L158              Benchmark]: Boogie Procedure Inliner took 43.28ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 78.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:14,130 INFO  L158              Benchmark]: Boogie Preprocessor took 69.61ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 74.4MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:14,131 INFO  L158              Benchmark]: IcfgBuilder took 788.46ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 63.1MB in the end (delta: 11.3MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:14,131 INFO  L158              Benchmark]: TraceAbstraction took 8938.77ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 62.4MB in the beginning and 152.9MB in the end (delta: -90.5MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:14,131 INFO  L158              Benchmark]: Witness Printer took 117.26ms. Allocated memory is still 268.4MB. Free memory was 152.9MB in the beginning and 141.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:14,133 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 123.4MB in the beginning and 123.1MB in the end (delta: 294.0kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 422.68ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 83.6MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 43.28ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 78.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 69.61ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 74.4MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 788.46ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 63.1MB in the end (delta: 11.3MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8938.77ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 62.4MB in the beginning and 152.9MB in the end (delta: -90.5MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB.
 * Witness Printer took 117.26ms. Allocated memory is still 268.4MB. Free memory was 152.9MB in the beginning and 141.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 458]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2179 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2179 mSDsluCounter, 1947 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 838 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6307 IncrementalHoareTripleChecker+Invalid, 7145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 838 mSolverCounterUnsat, 1632 mSDtfsCounter, 6307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2403occurred in iteration=9, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1131 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2438 NumberOfCodeBlocks, 2438 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2423 ConstructedInterpolants, 0 QuantifiedInterpolants, 7317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 371 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1640/1726 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 616]: Location Invariant
    Derived location invariant: ((((((((((((((a28 == 10) && (a19 == 1)) && (a11 != 1)) || ((a25 == 0) && (a28 <= 7))) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1))) || ((((a25 == 1) && (a11 == 1)) && (a19 == 1)) && (a28 <= 7))) || ((a11 != 1) && (a25 == 0))) || (((((a25 == 1) && (8 <= a17)) && (a28 <= 10)) && (a19 == 1)) && (a11 != 1))) || (((a25 == 1) && (a28 == 10)) && (a11 != 1))) || ((a17 <= 7) && (a25 == 0))) || ((9 <= a28) && (a17 <= 7))) || ((((a25 == 1) && (a11 == 1)) && (a17 <= 7)) && (a19 == 1))) || (((8 <= a17) && (a11 != 1)) && (a28 <= 7)))
RESULT: Ultimate proved your program to be correct!
[2025-03-03 09:49:14,149 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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