./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.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 dd1724e619d2e8fc18a4dc8aa6c726656a51fc7e14f993d511c4c773ed4748f3
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 14:50:22,186 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 14:50:22,246 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 14:50:22,250 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 14:50:22,250 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 14:50:22,269 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 14:50:22,269 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 14:50:22,269 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 14:50:22,270 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 14:50:22,270 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 14:50:22,271 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 14:50:22,271 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 14:50:22,271 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 14:50:22,271 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 14:50:22,272 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 14:50:22,272 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 14:50:22,272 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 14:50:22,272 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 14:50:22,272 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 14:50:22,272 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 14:50:22,272 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 14:50:22,272 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 14:50:22,273 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 14:50:22,273 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 14:50:22,273 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 14:50:22,273 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 14:50:22,273 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 14:50:22,273 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 14:50:22,273 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 14:50:22,273 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 14:50:22,274 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 14:50:22,274 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 14:50:22,275 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 -> dd1724e619d2e8fc18a4dc8aa6c726656a51fc7e14f993d511c4c773ed4748f3
[2025-03-03 14:50:22,505 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 14:50:22,512 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 14:50:22,514 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 14:50:22,514 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 14:50:22,515 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 14:50:22,516 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c
[2025-03-03 14:50:23,667 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7bf4dadd/348511bf9f5043fea969772067c7d5bc/FLAGaa05260df
[2025-03-03 14:50:23,924 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 14:50:23,925 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c
[2025-03-03 14:50:23,937 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7bf4dadd/348511bf9f5043fea969772067c7d5bc/FLAGaa05260df
[2025-03-03 14:50:24,241 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7bf4dadd/348511bf9f5043fea969772067c7d5bc
[2025-03-03 14:50:24,243 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 14:50:24,244 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 14:50:24,245 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 14:50:24,245 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 14:50:24,248 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 14:50:24,249 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,250 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d30aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24, skipping insertion in model container
[2025-03-03 14:50:24,250 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,278 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 14:50:24,472 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/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c[17005,17018]
[2025-03-03 14:50:24,476 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 14:50:24,489 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 14:50:24,532 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/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c[17005,17018]
[2025-03-03 14:50:24,532 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 14:50:24,548 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 14:50:24,548 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24 WrapperNode
[2025-03-03 14:50:24,548 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 14:50:24,549 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 14:50:24,549 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 14:50:24,549 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 14:50:24,553 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,560 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,581 INFO  L138                Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 451
[2025-03-03 14:50:24,581 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 14:50:24,582 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 14:50:24,582 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 14:50:24,582 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 14:50:24,589 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,589 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,593 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,607 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 14:50:24,608 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,608 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,617 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,618 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,619 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,625 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,628 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 14:50:24,629 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 14:50:24,629 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 14:50:24,629 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 14:50:24,630 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (1/1) ...
[2025-03-03 14:50:24,634 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 14:50:24,644 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:50:24,656 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 14:50:24,660 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 14:50:24,677 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 14:50:24,678 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 14:50:24,678 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 14:50:24,678 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 14:50:24,764 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 14:50:24,765 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 14:50:25,160 INFO  L?                        ?]: Removed 51 outVars from TransFormulas that were not future-live.
[2025-03-03 14:50:25,160 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 14:50:25,171 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 14:50:25,171 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 14:50:25,171 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:25 BoogieIcfgContainer
[2025-03-03 14:50:25,171 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 14:50:25,173 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 14:50:25,173 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 14:50:25,176 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 14:50:25,176 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:50:24" (1/3) ...
[2025-03-03 14:50:25,176 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fadf88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:25, skipping insertion in model container
[2025-03-03 14:50:25,176 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:24" (2/3) ...
[2025-03-03 14:50:25,177 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fadf88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:25, skipping insertion in model container
[2025-03-03 14:50:25,177 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:25" (3/3) ...
[2025-03-03 14:50:25,178 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c
[2025-03-03 14:50:25,189 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 14:50:25,190 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 14:50:25,226 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 14:50:25,235 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;@7fa6e27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 14:50:25,235 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 14:50:25,239 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 122 states, 120 states have (on average 1.7583333333333333) internal successors, (211), 121 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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 14:50:25,245 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-03-03 14:50:25,245 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:25,246 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]
[2025-03-03 14:50:25,247 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:25,251 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:25,251 INFO  L85        PathProgramCache]: Analyzing trace with hash 568524732, now seen corresponding path program 1 times
[2025-03-03 14:50:25,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:25,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753561676]
[2025-03-03 14:50:25,256 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:25,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:25,315 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-03-03 14:50:25,355 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-03-03 14:50:25,356 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:25,356 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:25,475 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 14:50:25,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:25,476 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753561676]
[2025-03-03 14:50:25,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753561676] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:25,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:25,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 14:50:25,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111628543]
[2025-03-03 14:50:25,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:25,481 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 14:50:25,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:25,495 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 14:50:25,496 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 14:50:25,498 INFO  L87              Difference]: Start difference. First operand  has 122 states, 120 states have (on average 1.7583333333333333) internal successors, (211), 121 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 14:50:25,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:25,513 INFO  L93              Difference]: Finished difference Result 195 states and 332 transitions.
[2025-03-03 14:50:25,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 14:50:25,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37
[2025-03-03 14:50:25,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:25,519 INFO  L225             Difference]: With dead ends: 195
[2025-03-03 14:50:25,519 INFO  L226             Difference]: Without dead ends: 119
[2025-03-03 14:50:25,521 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 14:50:25,525 INFO  L435           NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:25,525 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:25,545 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2025-03-03 14:50:25,554 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2025-03-03 14:50:25,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 118 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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 14:50:25,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 206 transitions.
[2025-03-03 14:50:25,561 INFO  L78                 Accepts]: Start accepts. Automaton has 119 states and 206 transitions. Word has length 37
[2025-03-03 14:50:25,561 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:25,561 INFO  L471      AbstractCegarLoop]: Abstraction has 119 states and 206 transitions.
[2025-03-03 14:50:25,561 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 14:50:25,561 INFO  L276                IsEmpty]: Start isEmpty. Operand 119 states and 206 transitions.
[2025-03-03 14:50:25,562 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-03-03 14:50:25,562 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:25,562 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]
[2025-03-03 14:50:25,563 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 14:50:25,563 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:25,563 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:25,563 INFO  L85        PathProgramCache]: Analyzing trace with hash -1441579109, now seen corresponding path program 1 times
[2025-03-03 14:50:25,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:25,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981975716]
[2025-03-03 14:50:25,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:25,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:25,577 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-03-03 14:50:25,609 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-03-03 14:50:25,610 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:25,610 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:25,802 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 14:50:25,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:25,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981975716]
[2025-03-03 14:50:25,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981975716] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:25,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:25,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:50:25,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257227848]
[2025-03-03 14:50:25,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:25,804 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:50:25,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:25,805 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:50:25,805 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:50:25,805 INFO  L87              Difference]: Start difference. First operand 119 states and 206 transitions. Second operand  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 14:50:25,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:25,891 INFO  L93              Difference]: Finished difference Result 195 states and 328 transitions.
[2025-03-03 14:50:25,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:50:25,892 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37
[2025-03-03 14:50:25,892 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:25,893 INFO  L225             Difference]: With dead ends: 195
[2025-03-03 14:50:25,895 INFO  L226             Difference]: Without dead ends: 119
[2025-03-03 14:50:25,895 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:50:25,896 INFO  L435           NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:25,896 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 770 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:25,897 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2025-03-03 14:50:25,900 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2025-03-03 14:50:25,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 118 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 14:50:25,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions.
[2025-03-03 14:50:25,903 INFO  L78                 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 37
[2025-03-03 14:50:25,903 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:25,903 INFO  L471      AbstractCegarLoop]: Abstraction has 119 states and 165 transitions.
[2025-03-03 14:50:25,903 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 14:50:25,903 INFO  L276                IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions.
[2025-03-03 14:50:25,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 14:50:25,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:25,904 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]
[2025-03-03 14:50:25,905 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 14:50:25,905 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:25,906 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:25,906 INFO  L85        PathProgramCache]: Analyzing trace with hash -778545037, now seen corresponding path program 1 times
[2025-03-03 14:50:25,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:25,906 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061694254]
[2025-03-03 14:50:25,906 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:25,906 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:25,924 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 14:50:25,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 14:50:25,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:25,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:26,039 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 14:50:26,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:26,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061694254]
[2025-03-03 14:50:26,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061694254] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:26,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:26,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:26,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842615688]
[2025-03-03 14:50:26,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:26,041 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:26,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:26,041 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:26,042 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:26,044 INFO  L87              Difference]: Start difference. First operand 119 states and 165 transitions. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 14:50:26,072 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:26,072 INFO  L93              Difference]: Finished difference Result 255 states and 387 transitions.
[2025-03-03 14:50:26,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:26,073 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77
[2025-03-03 14:50:26,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:26,074 INFO  L225             Difference]: With dead ends: 255
[2025-03-03 14:50:26,074 INFO  L226             Difference]: Without dead ends: 183
[2025-03-03 14:50:26,074 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 14:50:26,075 INFO  L435           NwaCegarLoop]: 245 mSDtfsCounter, 102 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:26,075 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:26,075 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2025-03-03 14:50:26,087 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181.
[2025-03-03 14:50:26,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 181 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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 14:50:26,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions.
[2025-03-03 14:50:26,092 INFO  L78                 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 77
[2025-03-03 14:50:26,093 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:26,093 INFO  L471      AbstractCegarLoop]: Abstraction has 181 states and 267 transitions.
[2025-03-03 14:50:26,093 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 14:50:26,093 INFO  L276                IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions.
[2025-03-03 14:50:26,094 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 14:50:26,094 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:26,094 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]
[2025-03-03 14:50:26,094 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 14:50:26,094 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:26,095 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:26,095 INFO  L85        PathProgramCache]: Analyzing trace with hash -995176544, now seen corresponding path program 1 times
[2025-03-03 14:50:26,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:26,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691991433]
[2025-03-03 14:50:26,095 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:26,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:26,112 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 14:50:26,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 14:50:26,143 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:26,143 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:26,213 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 14:50:26,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:26,213 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691991433]
[2025-03-03 14:50:26,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691991433] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:26,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:26,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:26,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406338318]
[2025-03-03 14:50:26,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:26,214 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:26,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:26,214 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:26,214 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:26,214 INFO  L87              Difference]: Start difference. First operand 181 states and 267 transitions. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 14:50:26,235 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:26,235 INFO  L93              Difference]: Finished difference Result 433 states and 679 transitions.
[2025-03-03 14:50:26,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:26,235 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77
[2025-03-03 14:50:26,237 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:26,240 INFO  L225             Difference]: With dead ends: 433
[2025-03-03 14:50:26,240 INFO  L226             Difference]: Without dead ends: 299
[2025-03-03 14:50:26,241 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 14:50:26,242 INFO  L435           NwaCegarLoop]: 238 mSDtfsCounter, 98 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:26,243 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 361 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:26,244 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 299 states.
[2025-03-03 14:50:26,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297.
[2025-03-03 14:50:26,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 297 states, 296 states have (on average 1.5405405405405406) internal successors, (456), 296 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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 14:50:26,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 456 transitions.
[2025-03-03 14:50:26,253 INFO  L78                 Accepts]: Start accepts. Automaton has 297 states and 456 transitions. Word has length 77
[2025-03-03 14:50:26,253 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:26,253 INFO  L471      AbstractCegarLoop]: Abstraction has 297 states and 456 transitions.
[2025-03-03 14:50:26,253 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 14:50:26,253 INFO  L276                IsEmpty]: Start isEmpty. Operand 297 states and 456 transitions.
[2025-03-03 14:50:26,254 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 14:50:26,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:26,255 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]
[2025-03-03 14:50:26,255 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 14:50:26,255 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:26,255 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:26,255 INFO  L85        PathProgramCache]: Analyzing trace with hash -808327859, now seen corresponding path program 1 times
[2025-03-03 14:50:26,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:26,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042885519]
[2025-03-03 14:50:26,256 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:26,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:26,275 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 14:50:26,294 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 14:50:26,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:26,294 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:26,354 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 14:50:26,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:26,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042885519]
[2025-03-03 14:50:26,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042885519] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:26,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:26,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:26,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421451507]
[2025-03-03 14:50:26,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:26,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:26,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:26,355 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:26,355 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:26,356 INFO  L87              Difference]: Start difference. First operand 297 states and 456 transitions. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 14:50:26,378 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:26,378 INFO  L93              Difference]: Finished difference Result 765 states and 1218 transitions.
[2025-03-03 14:50:26,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:26,379 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77
[2025-03-03 14:50:26,379 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:26,380 INFO  L225             Difference]: With dead ends: 765
[2025-03-03 14:50:26,380 INFO  L226             Difference]: Without dead ends: 515
[2025-03-03 14:50:26,381 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 14:50:26,381 INFO  L435           NwaCegarLoop]: 231 mSDtfsCounter, 94 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:26,382 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:26,382 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 515 states.
[2025-03-03 14:50:26,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513.
[2025-03-03 14:50:26,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 513 states, 512 states have (on average 1.5703125) internal successors, (804), 512 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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 14:50:26,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 804 transitions.
[2025-03-03 14:50:26,405 INFO  L78                 Accepts]: Start accepts. Automaton has 513 states and 804 transitions. Word has length 77
[2025-03-03 14:50:26,405 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:26,405 INFO  L471      AbstractCegarLoop]: Abstraction has 513 states and 804 transitions.
[2025-03-03 14:50:26,405 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 14:50:26,405 INFO  L276                IsEmpty]: Start isEmpty. Operand 513 states and 804 transitions.
[2025-03-03 14:50:26,409 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 14:50:26,409 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:26,409 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]
[2025-03-03 14:50:26,409 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 14:50:26,409 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:26,409 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:26,409 INFO  L85        PathProgramCache]: Analyzing trace with hash -619390598, now seen corresponding path program 1 times
[2025-03-03 14:50:26,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:26,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617816667]
[2025-03-03 14:50:26,410 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:26,410 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:26,423 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 14:50:26,437 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 14:50:26,437 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:26,437 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:26,628 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 14:50:26,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:26,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617816667]
[2025-03-03 14:50:26,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617816667] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:26,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:26,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:26,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935240357]
[2025-03-03 14:50:26,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:26,628 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:26,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:26,629 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:26,629 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:26,629 INFO  L87              Difference]: Start difference. First operand 513 states and 804 transitions. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 14:50:26,823 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:26,823 INFO  L93              Difference]: Finished difference Result 3775 states and 6103 transitions.
[2025-03-03 14:50:26,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:26,824 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77
[2025-03-03 14:50:26,824 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:26,838 INFO  L225             Difference]: With dead ends: 3775
[2025-03-03 14:50:26,838 INFO  L226             Difference]: Without dead ends: 3309
[2025-03-03 14:50:26,841 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:26,841 INFO  L435           NwaCegarLoop]: 161 mSDtfsCounter, 2135 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:26,841 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2135 Valid, 1557 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:26,846 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3309 states.
[2025-03-03 14:50:26,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 977.
[2025-03-03 14:50:26,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 977 states, 976 states have (on average 1.5819672131147542) internal successors, (1544), 976 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states 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 14:50:26,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1544 transitions.
[2025-03-03 14:50:26,898 INFO  L78                 Accepts]: Start accepts. Automaton has 977 states and 1544 transitions. Word has length 77
[2025-03-03 14:50:26,898 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:26,898 INFO  L471      AbstractCegarLoop]: Abstraction has 977 states and 1544 transitions.
[2025-03-03 14:50:26,898 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 14:50:26,898 INFO  L276                IsEmpty]: Start isEmpty. Operand 977 states and 1544 transitions.
[2025-03-03 14:50:26,899 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2025-03-03 14:50:26,899 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:26,899 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]
[2025-03-03 14:50:26,899 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 14:50:26,899 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:26,899 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:26,899 INFO  L85        PathProgramCache]: Analyzing trace with hash -1991625142, now seen corresponding path program 1 times
[2025-03-03 14:50:26,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:26,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694717088]
[2025-03-03 14:50:26,899 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:26,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:26,910 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes.
[2025-03-03 14:50:26,941 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements.
[2025-03-03 14:50:26,941 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:26,941 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:27,284 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 14:50:27,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:27,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694717088]
[2025-03-03 14:50:27,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694717088] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:27,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:27,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:50:27,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448255985]
[2025-03-03 14:50:27,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:27,284 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:50:27,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:27,285 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:50:27,285 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:50:27,285 INFO  L87              Difference]: Start difference. First operand 977 states and 1544 transitions. Second operand  has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 14:50:27,313 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:27,313 INFO  L93              Difference]: Finished difference Result 1027 states and 1609 transitions.
[2025-03-03 14:50:27,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:50:27,314 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 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 78
[2025-03-03 14:50:27,314 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:27,317 INFO  L225             Difference]: With dead ends: 1027
[2025-03-03 14:50:27,317 INFO  L226             Difference]: Without dead ends: 1025
[2025-03-03 14:50:27,318 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:50:27,319 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:27,319 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 640 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:27,320 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1025 states.
[2025-03-03 14:50:27,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025.
[2025-03-03 14:50:27,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1025 states, 1024 states have (on average 1.5546875) internal successors, (1592), 1024 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states 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 14:50:27,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1592 transitions.
[2025-03-03 14:50:27,349 INFO  L78                 Accepts]: Start accepts. Automaton has 1025 states and 1592 transitions. Word has length 78
[2025-03-03 14:50:27,349 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:27,350 INFO  L471      AbstractCegarLoop]: Abstraction has 1025 states and 1592 transitions.
[2025-03-03 14:50:27,350 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 14:50:27,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 1025 states and 1592 transitions.
[2025-03-03 14:50:27,350 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-03-03 14:50:27,350 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:27,350 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]
[2025-03-03 14:50:27,350 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 14:50:27,350 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:27,351 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:27,351 INFO  L85        PathProgramCache]: Analyzing trace with hash -1522117702, now seen corresponding path program 1 times
[2025-03-03 14:50:27,351 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:27,351 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611678188]
[2025-03-03 14:50:27,351 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:27,351 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:27,368 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-03-03 14:50:27,379 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-03-03 14:50:27,379 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:27,379 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:27,439 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 14:50:27,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:27,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611678188]
[2025-03-03 14:50:27,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611678188] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:27,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:27,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:27,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135434832]
[2025-03-03 14:50:27,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:27,441 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:27,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:27,441 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:27,441 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:27,442 INFO  L87              Difference]: Start difference. First operand 1025 states and 1592 transitions. Second operand  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 14:50:27,489 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:27,489 INFO  L93              Difference]: Finished difference Result 2861 states and 4482 transitions.
[2025-03-03 14:50:27,490 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:27,491 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79
[2025-03-03 14:50:27,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:27,497 INFO  L225             Difference]: With dead ends: 2861
[2025-03-03 14:50:27,497 INFO  L226             Difference]: Without dead ends: 1883
[2025-03-03 14:50:27,498 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 14:50:27,499 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 78 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:27,499 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 275 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:27,501 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1883 states.
[2025-03-03 14:50:27,548 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1865.
[2025-03-03 14:50:27,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1865 states, 1864 states have (on average 1.5493562231759657) internal successors, (2888), 1864 states have internal predecessors, (2888), 0 states have call successors, (0), 0 states 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 14:50:27,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2888 transitions.
[2025-03-03 14:50:27,558 INFO  L78                 Accepts]: Start accepts. Automaton has 1865 states and 2888 transitions. Word has length 79
[2025-03-03 14:50:27,558 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:27,558 INFO  L471      AbstractCegarLoop]: Abstraction has 1865 states and 2888 transitions.
[2025-03-03 14:50:27,558 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 14:50:27,558 INFO  L276                IsEmpty]: Start isEmpty. Operand 1865 states and 2888 transitions.
[2025-03-03 14:50:27,560 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-03-03 14:50:27,561 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:27,561 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]
[2025-03-03 14:50:27,562 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 14:50:27,562 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:27,562 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:27,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 1094459095, now seen corresponding path program 1 times
[2025-03-03 14:50:27,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:27,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327621321]
[2025-03-03 14:50:27,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:27,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:27,577 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-03-03 14:50:27,586 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-03-03 14:50:27,586 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:27,587 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:27,623 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 14:50:27,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:27,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327621321]
[2025-03-03 14:50:27,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327621321] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:27,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:27,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:27,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175924485]
[2025-03-03 14:50:27,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:27,624 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:27,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:27,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:27,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:27,625 INFO  L87              Difference]: Start difference. First operand 1865 states and 2888 transitions. Second operand  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 14:50:27,682 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:27,683 INFO  L93              Difference]: Finished difference Result 5245 states and 8122 transitions.
[2025-03-03 14:50:27,683 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:27,683 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80
[2025-03-03 14:50:27,684 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:27,694 INFO  L225             Difference]: With dead ends: 5245
[2025-03-03 14:50:27,694 INFO  L226             Difference]: Without dead ends: 3427
[2025-03-03 14:50:27,698 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 14:50:27,699 INFO  L435           NwaCegarLoop]: 208 mSDtfsCounter, 86 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:27,699 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 343 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:27,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3427 states.
[2025-03-03 14:50:27,776 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 3425.
[2025-03-03 14:50:27,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3425 states, 3424 states have (on average 1.5327102803738317) internal successors, (5248), 3424 states have internal predecessors, (5248), 0 states have call successors, (0), 0 states 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 14:50:27,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 5248 transitions.
[2025-03-03 14:50:27,790 INFO  L78                 Accepts]: Start accepts. Automaton has 3425 states and 5248 transitions. Word has length 80
[2025-03-03 14:50:27,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:27,791 INFO  L471      AbstractCegarLoop]: Abstraction has 3425 states and 5248 transitions.
[2025-03-03 14:50:27,791 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 14:50:27,791 INFO  L276                IsEmpty]: Start isEmpty. Operand 3425 states and 5248 transitions.
[2025-03-03 14:50:27,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-03-03 14:50:27,792 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:27,792 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]
[2025-03-03 14:50:27,793 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 14:50:27,793 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:27,794 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:27,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -64216795, now seen corresponding path program 1 times
[2025-03-03 14:50:27,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:27,794 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697844683]
[2025-03-03 14:50:27,794 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:27,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:27,805 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-03-03 14:50:27,812 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-03-03 14:50:27,813 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:27,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:27,849 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 14:50:27,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:27,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697844683]
[2025-03-03 14:50:27,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697844683] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:27,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:27,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:27,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991466097]
[2025-03-03 14:50:27,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:27,850 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:27,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:27,850 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:27,850 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:27,850 INFO  L87              Difference]: Start difference. First operand 3425 states and 5248 transitions. Second operand  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 14:50:27,935 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:27,935 INFO  L93              Difference]: Finished difference Result 9669 states and 14754 transitions.
[2025-03-03 14:50:27,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:27,935 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80
[2025-03-03 14:50:27,936 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:27,954 INFO  L225             Difference]: With dead ends: 9669
[2025-03-03 14:50:27,954 INFO  L226             Difference]: Without dead ends: 6291
[2025-03-03 14:50:27,959 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 14:50:27,960 INFO  L435           NwaCegarLoop]: 225 mSDtfsCounter, 90 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:27,960 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 356 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:27,964 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6291 states.
[2025-03-03 14:50:28,091 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 6289.
[2025-03-03 14:50:28,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6289 states, 6288 states have (on average 1.508905852417303) internal successors, (9488), 6288 states have internal predecessors, (9488), 0 states have call successors, (0), 0 states 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 14:50:28,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6289 states to 6289 states and 9488 transitions.
[2025-03-03 14:50:28,118 INFO  L78                 Accepts]: Start accepts. Automaton has 6289 states and 9488 transitions. Word has length 80
[2025-03-03 14:50:28,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:28,118 INFO  L471      AbstractCegarLoop]: Abstraction has 6289 states and 9488 transitions.
[2025-03-03 14:50:28,118 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 14:50:28,118 INFO  L276                IsEmpty]: Start isEmpty. Operand 6289 states and 9488 transitions.
[2025-03-03 14:50:28,118 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-03-03 14:50:28,118 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:28,119 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]
[2025-03-03 14:50:28,119 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 14:50:28,119 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:28,120 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:28,120 INFO  L85        PathProgramCache]: Analyzing trace with hash -744797296, now seen corresponding path program 1 times
[2025-03-03 14:50:28,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:28,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460998274]
[2025-03-03 14:50:28,120 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:28,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:28,129 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-03-03 14:50:28,134 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-03-03 14:50:28,135 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:28,135 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:28,165 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 14:50:28,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:28,166 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460998274]
[2025-03-03 14:50:28,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460998274] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:28,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:28,166 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:28,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51384218]
[2025-03-03 14:50:28,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:28,166 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:28,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:28,167 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:28,167 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:28,167 INFO  L87              Difference]: Start difference. First operand 6289 states and 9488 transitions. Second operand  has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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 14:50:28,293 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:28,293 INFO  L93              Difference]: Finished difference Result 12440 states and 18838 transitions.
[2025-03-03 14:50:28,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:28,293 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81
[2025-03-03 14:50:28,294 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:28,320 INFO  L225             Difference]: With dead ends: 12440
[2025-03-03 14:50:28,320 INFO  L226             Difference]: Without dead ends: 9045
[2025-03-03 14:50:28,325 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 14:50:28,325 INFO  L435           NwaCegarLoop]: 259 mSDtfsCounter, 103 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:28,325 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 374 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:28,331 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9045 states.
[2025-03-03 14:50:28,509 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9045 to 9043.
[2025-03-03 14:50:28,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9043 states, 9042 states have (on average 1.4990046449900465) internal successors, (13554), 9042 states have internal predecessors, (13554), 0 states have call successors, (0), 0 states 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 14:50:28,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9043 states to 9043 states and 13554 transitions.
[2025-03-03 14:50:28,551 INFO  L78                 Accepts]: Start accepts. Automaton has 9043 states and 13554 transitions. Word has length 81
[2025-03-03 14:50:28,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:28,552 INFO  L471      AbstractCegarLoop]: Abstraction has 9043 states and 13554 transitions.
[2025-03-03 14:50:28,553 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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 14:50:28,553 INFO  L276                IsEmpty]: Start isEmpty. Operand 9043 states and 13554 transitions.
[2025-03-03 14:50:28,561 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:28,561 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:28,562 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:28,562 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 14:50:28,562 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:28,562 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:28,562 INFO  L85        PathProgramCache]: Analyzing trace with hash -444117991, now seen corresponding path program 1 times
[2025-03-03 14:50:28,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:28,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723530884]
[2025-03-03 14:50:28,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:28,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:28,577 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:28,588 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:28,589 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:28,589 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:28,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 14:50:28,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:28,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723530884]
[2025-03-03 14:50:28,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723530884] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:28,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:28,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:28,759 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973184115]
[2025-03-03 14:50:28,759 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:28,760 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:28,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:28,760 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:28,760 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:28,760 INFO  L87              Difference]: Start difference. First operand 9043 states and 13554 transitions. Second operand  has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 14:50:29,201 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:29,202 INFO  L93              Difference]: Finished difference Result 34753 states and 52617 transitions.
[2025-03-03 14:50:29,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:29,202 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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 111
[2025-03-03 14:50:29,202 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:29,295 INFO  L225             Difference]: With dead ends: 34753
[2025-03-03 14:50:29,295 INFO  L226             Difference]: Without dead ends: 30207
[2025-03-03 14:50:29,305 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:29,305 INFO  L435           NwaCegarLoop]: 282 mSDtfsCounter, 1318 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:29,306 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1692 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:29,328 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30207 states.
[2025-03-03 14:50:29,681 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30207 to 13491.
[2025-03-03 14:50:29,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13491 states, 13490 states have (on average 1.4993328391401037) internal successors, (20226), 13490 states have internal predecessors, (20226), 0 states have call successors, (0), 0 states 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 14:50:29,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 20226 transitions.
[2025-03-03 14:50:29,735 INFO  L78                 Accepts]: Start accepts. Automaton has 13491 states and 20226 transitions. Word has length 111
[2025-03-03 14:50:29,735 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:29,735 INFO  L471      AbstractCegarLoop]: Abstraction has 13491 states and 20226 transitions.
[2025-03-03 14:50:29,736 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 14:50:29,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 13491 states and 20226 transitions.
[2025-03-03 14:50:29,742 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:29,742 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:29,742 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:29,743 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 14:50:29,743 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:29,743 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:29,743 INFO  L85        PathProgramCache]: Analyzing trace with hash 141215429, now seen corresponding path program 1 times
[2025-03-03 14:50:29,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:29,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840026689]
[2025-03-03 14:50:29,743 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:29,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:29,754 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:29,764 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:29,764 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:29,764 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:29,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 14:50:29,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:29,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840026689]
[2025-03-03 14:50:29,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840026689] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:29,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:29,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:29,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354847662]
[2025-03-03 14:50:29,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:29,958 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:29,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:29,959 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:29,959 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:29,959 INFO  L87              Difference]: Start difference. First operand 13491 states and 20226 transitions. Second operand  has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,564 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:30,564 INFO  L93              Difference]: Finished difference Result 39201 states and 59289 transitions.
[2025-03-03 14:50:30,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:30,565 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111
[2025-03-03 14:50:30,565 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:30,628 INFO  L225             Difference]: With dead ends: 39201
[2025-03-03 14:50:30,629 INFO  L226             Difference]: Without dead ends: 34655
[2025-03-03 14:50:30,647 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:30,648 INFO  L435           NwaCegarLoop]: 280 mSDtfsCounter, 1355 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:30,648 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1524 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:30,676 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34655 states.
[2025-03-03 14:50:31,102 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34655 to 17939.
[2025-03-03 14:50:31,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17939 states, 17938 states have (on average 1.4994982718251757) internal successors, (26898), 17938 states have internal predecessors, (26898), 0 states have call successors, (0), 0 states 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 14:50:31,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17939 states to 17939 states and 26898 transitions.
[2025-03-03 14:50:31,162 INFO  L78                 Accepts]: Start accepts. Automaton has 17939 states and 26898 transitions. Word has length 111
[2025-03-03 14:50:31,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:31,162 INFO  L471      AbstractCegarLoop]: Abstraction has 17939 states and 26898 transitions.
[2025-03-03 14:50:31,163 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:31,163 INFO  L276                IsEmpty]: Start isEmpty. Operand 17939 states and 26898 transitions.
[2025-03-03 14:50:31,168 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:31,168 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:31,169 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:31,169 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 14:50:31,169 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:31,169 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:31,169 INFO  L85        PathProgramCache]: Analyzing trace with hash -1959889039, now seen corresponding path program 1 times
[2025-03-03 14:50:31,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:31,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18286720]
[2025-03-03 14:50:31,170 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:31,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:31,179 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:31,187 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:31,187 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:31,187 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:31,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-03 14:50:31,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:31,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18286720]
[2025-03-03 14:50:31,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18286720] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:31,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:31,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:31,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898486167]
[2025-03-03 14:50:31,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:31,356 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:31,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:31,357 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:31,358 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:31,358 INFO  L87              Difference]: Start difference. First operand 17939 states and 26898 transitions. Second operand  has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 14:50:31,871 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:31,871 INFO  L93              Difference]: Finished difference Result 43649 states and 65961 transitions.
[2025-03-03 14:50:31,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:31,872 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 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 111
[2025-03-03 14:50:31,872 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:31,932 INFO  L225             Difference]: With dead ends: 43649
[2025-03-03 14:50:31,932 INFO  L226             Difference]: Without dead ends: 39103
[2025-03-03 14:50:31,943 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:31,943 INFO  L435           NwaCegarLoop]: 278 mSDtfsCounter, 1507 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:31,944 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1476 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:31,966 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39103 states.
[2025-03-03 14:50:32,415 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39103 to 22387.
[2025-03-03 14:50:32,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22387 states, 22386 states have (on average 1.499597963012597) internal successors, (33570), 22386 states have internal predecessors, (33570), 0 states have call successors, (0), 0 states 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 14:50:32,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22387 states to 22387 states and 33570 transitions.
[2025-03-03 14:50:32,483 INFO  L78                 Accepts]: Start accepts. Automaton has 22387 states and 33570 transitions. Word has length 111
[2025-03-03 14:50:32,484 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:32,484 INFO  L471      AbstractCegarLoop]: Abstraction has 22387 states and 33570 transitions.
[2025-03-03 14:50:32,484 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 14:50:32,484 INFO  L276                IsEmpty]: Start isEmpty. Operand 22387 states and 33570 transitions.
[2025-03-03 14:50:32,491 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:32,491 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:32,491 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:32,491 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 14:50:32,492 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:32,492 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:32,492 INFO  L85        PathProgramCache]: Analyzing trace with hash 1750550818, now seen corresponding path program 1 times
[2025-03-03 14:50:32,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:32,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28706637]
[2025-03-03 14:50:32,492 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:32,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:32,504 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:32,519 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:32,519 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:32,519 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:32,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-03-03 14:50:32,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:32,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28706637]
[2025-03-03 14:50:32,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28706637] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:32,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:32,682 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:32,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414589492]
[2025-03-03 14:50:32,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:32,683 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:32,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:32,683 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:32,683 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:32,683 INFO  L87              Difference]: Start difference. First operand 22387 states and 33570 transitions. Second operand  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 14:50:33,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:33,375 INFO  L93              Difference]: Finished difference Result 48097 states and 72633 transitions.
[2025-03-03 14:50:33,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:33,375 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 111
[2025-03-03 14:50:33,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:33,455 INFO  L225             Difference]: With dead ends: 48097
[2025-03-03 14:50:33,455 INFO  L226             Difference]: Without dead ends: 43551
[2025-03-03 14:50:33,475 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:33,475 INFO  L435           NwaCegarLoop]: 278 mSDtfsCounter, 1404 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:33,476 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 1571 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:33,501 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43551 states.
[2025-03-03 14:50:34,018 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43551 to 26835.
[2025-03-03 14:50:34,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26835 states, 26834 states have (on average 1.4996646046060969) internal successors, (40242), 26834 states have internal predecessors, (40242), 0 states have call successors, (0), 0 states 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 14:50:34,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26835 states to 26835 states and 40242 transitions.
[2025-03-03 14:50:34,086 INFO  L78                 Accepts]: Start accepts. Automaton has 26835 states and 40242 transitions. Word has length 111
[2025-03-03 14:50:34,086 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:34,086 INFO  L471      AbstractCegarLoop]: Abstraction has 26835 states and 40242 transitions.
[2025-03-03 14:50:34,086 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 14:50:34,086 INFO  L276                IsEmpty]: Start isEmpty. Operand 26835 states and 40242 transitions.
[2025-03-03 14:50:34,092 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:34,092 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:34,093 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:34,093 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 14:50:34,093 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:34,093 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:34,093 INFO  L85        PathProgramCache]: Analyzing trace with hash 591874928, now seen corresponding path program 1 times
[2025-03-03 14:50:34,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:34,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665466951]
[2025-03-03 14:50:34,094 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:34,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:34,103 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:34,117 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:34,117 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:34,117 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:34,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 14:50:34,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:34,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665466951]
[2025-03-03 14:50:34,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665466951] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:34,245 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:34,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:34,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660748321]
[2025-03-03 14:50:34,245 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:34,246 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:34,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:34,247 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:34,247 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:34,247 INFO  L87              Difference]: Start difference. First operand 26835 states and 40242 transitions. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 14:50:34,827 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:34,827 INFO  L93              Difference]: Finished difference Result 52545 states and 79305 transitions.
[2025-03-03 14:50:34,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:34,827 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 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 111
[2025-03-03 14:50:34,828 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:34,878 INFO  L225             Difference]: With dead ends: 52545
[2025-03-03 14:50:34,879 INFO  L226             Difference]: Without dead ends: 47999
[2025-03-03 14:50:34,889 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:34,890 INFO  L435           NwaCegarLoop]: 277 mSDtfsCounter, 1238 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:34,890 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1718 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:34,913 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47999 states.
[2025-03-03 14:50:35,366 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47999 to 31283.
[2025-03-03 14:50:35,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31283 states, 31282 states have (on average 1.499712294610319) internal successors, (46914), 31282 states have internal predecessors, (46914), 0 states have call successors, (0), 0 states 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 14:50:35,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31283 states to 31283 states and 46914 transitions.
[2025-03-03 14:50:35,435 INFO  L78                 Accepts]: Start accepts. Automaton has 31283 states and 46914 transitions. Word has length 111
[2025-03-03 14:50:35,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:35,436 INFO  L471      AbstractCegarLoop]: Abstraction has 31283 states and 46914 transitions.
[2025-03-03 14:50:35,436 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 14:50:35,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 31283 states and 46914 transitions.
[2025-03-03 14:50:35,502 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2025-03-03 14:50:35,502 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:35,502 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:35,502 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 14:50:35,502 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:35,503 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:35,503 INFO  L85        PathProgramCache]: Analyzing trace with hash -113527579, now seen corresponding path program 1 times
[2025-03-03 14:50:35,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:35,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648486776]
[2025-03-03 14:50:35,503 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:35,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:35,512 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-03 14:50:35,536 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-03 14:50:35,536 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:35,536 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:35,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:35,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:35,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648486776]
[2025-03-03 14:50:35,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648486776] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:35,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:35,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:35,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002129268]
[2025-03-03 14:50:35,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:35,604 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:35,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:35,604 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:35,604 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:35,604 INFO  L87              Difference]: Start difference. First operand 31283 states and 46914 transitions. Second operand  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 14:50:35,904 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:35,904 INFO  L93              Difference]: Finished difference Result 62519 states and 93780 transitions.
[2025-03-03 14:50:35,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:35,905 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112
[2025-03-03 14:50:35,905 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:35,941 INFO  L225             Difference]: With dead ends: 62519
[2025-03-03 14:50:35,941 INFO  L226             Difference]: Without dead ends: 31285
[2025-03-03 14:50:35,970 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 14:50:35,971 INFO  L435           NwaCegarLoop]: 209 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:35,971 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:35,987 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31285 states.
[2025-03-03 14:50:36,561 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31285 to 31283.
[2025-03-03 14:50:36,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31283 states, 31282 states have (on average 1.488971293395563) internal successors, (46578), 31282 states have internal predecessors, (46578), 0 states have call successors, (0), 0 states 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 14:50:36,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31283 states to 31283 states and 46578 transitions.
[2025-03-03 14:50:36,637 INFO  L78                 Accepts]: Start accepts. Automaton has 31283 states and 46578 transitions. Word has length 112
[2025-03-03 14:50:36,637 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:36,637 INFO  L471      AbstractCegarLoop]: Abstraction has 31283 states and 46578 transitions.
[2025-03-03 14:50:36,637 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 14:50:36,637 INFO  L276                IsEmpty]: Start isEmpty. Operand 31283 states and 46578 transitions.
[2025-03-03 14:50:36,641 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2025-03-03 14:50:36,642 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:36,642 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:36,642 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 14:50:36,642 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:36,642 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:36,643 INFO  L85        PathProgramCache]: Analyzing trace with hash -413165192, now seen corresponding path program 1 times
[2025-03-03 14:50:36,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:36,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759430913]
[2025-03-03 14:50:36,643 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:36,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:36,654 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-03 14:50:36,673 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-03 14:50:36,673 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:36,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:36,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:36,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:36,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759430913]
[2025-03-03 14:50:36,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759430913] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:36,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:36,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:36,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899546212]
[2025-03-03 14:50:36,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:36,747 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:36,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:36,747 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:36,748 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:36,748 INFO  L87              Difference]: Start difference. First operand 31283 states and 46578 transitions. Second operand  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 14:50:37,020 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:37,021 INFO  L93              Difference]: Finished difference Result 46903 states and 69844 transitions.
[2025-03-03 14:50:37,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:37,021 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112
[2025-03-03 14:50:37,021 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:37,041 INFO  L225             Difference]: With dead ends: 46903
[2025-03-03 14:50:37,041 INFO  L226             Difference]: Without dead ends: 15669
[2025-03-03 14:50:37,059 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 14:50:37,060 INFO  L435           NwaCegarLoop]: 200 mSDtfsCounter, 75 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:37,060 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 340 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:37,068 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15669 states.
[2025-03-03 14:50:37,399 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15669 to 15667.
[2025-03-03 14:50:37,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15667 states, 15666 states have (on average 1.477467126260692) internal successors, (23146), 15666 states have internal predecessors, (23146), 0 states have call successors, (0), 0 states 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 14:50:37,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15667 states to 15667 states and 23146 transitions.
[2025-03-03 14:50:37,438 INFO  L78                 Accepts]: Start accepts. Automaton has 15667 states and 23146 transitions. Word has length 112
[2025-03-03 14:50:37,438 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:37,438 INFO  L471      AbstractCegarLoop]: Abstraction has 15667 states and 23146 transitions.
[2025-03-03 14:50:37,438 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 14:50:37,438 INFO  L276                IsEmpty]: Start isEmpty. Operand 15667 states and 23146 transitions.
[2025-03-03 14:50:37,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2025-03-03 14:50:37,441 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:37,441 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:37,441 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 14:50:37,442 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:37,442 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:37,442 INFO  L85        PathProgramCache]: Analyzing trace with hash -1032142965, now seen corresponding path program 1 times
[2025-03-03 14:50:37,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:37,442 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298837089]
[2025-03-03 14:50:37,442 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:37,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:37,455 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-03 14:50:37,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-03 14:50:37,478 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:37,478 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:38,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:38,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:38,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298837089]
[2025-03-03 14:50:38,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298837089] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:50:38,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117822770]
[2025-03-03 14:50:38,696 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:38,696 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:50:38,697 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:50:38,698 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 14:50:38,700 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 14:50:38,777 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-03 14:50:38,836 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-03 14:50:38,836 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:38,836 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:38,840 INFO  L256         TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 21 conjuncts are in the unsatisfiable core
[2025-03-03 14:50:38,845 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:50:39,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:39,370 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:50:39,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:39,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117822770] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:50:39,891 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:50:39,891 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 8] total 23
[2025-03-03 14:50:39,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095402743]
[2025-03-03 14:50:39,891 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:50:39,892 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-03-03 14:50:39,892 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:39,892 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-03-03 14:50:39,892 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506
[2025-03-03 14:50:39,893 INFO  L87              Difference]: Start difference. First operand 15667 states and 23146 transitions. Second operand  has 23 states, 23 states have (on average 14.304347826086957) internal successors, (329), 23 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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 14:50:50,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:50,958 INFO  L93              Difference]: Finished difference Result 166711 states and 243814 transitions.
[2025-03-03 14:50:50,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. 
[2025-03-03 14:50:50,958 INFO  L78                 Accepts]: Start accepts. Automaton has  has 23 states, 23 states have (on average 14.304347826086957) internal successors, (329), 23 states have internal predecessors, (329), 0 states have call successors, (0), 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 112
[2025-03-03 14:50:50,958 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:51,124 INFO  L225             Difference]: With dead ends: 166711
[2025-03-03 14:50:51,125 INFO  L226             Difference]: Without dead ends: 155957
[2025-03-03 14:50:51,159 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19610 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=5425, Invalid=40157, Unknown=0, NotChecked=0, Total=45582
[2025-03-03 14:50:51,159 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 8611 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8611 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:51,159 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [8611 Valid, 2896 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 14:50:51,237 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 155957 states.
[2025-03-03 14:50:53,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 155957 to 137155.
[2025-03-03 14:50:54,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 137155 states, 137154 states have (on average 1.4504425682079998) internal successors, (198934), 137154 states have internal predecessors, (198934), 0 states have call successors, (0), 0 states 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 14:50:54,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 137155 states to 137155 states and 198934 transitions.
[2025-03-03 14:50:54,187 INFO  L78                 Accepts]: Start accepts. Automaton has 137155 states and 198934 transitions. Word has length 112
[2025-03-03 14:50:54,187 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:54,187 INFO  L471      AbstractCegarLoop]: Abstraction has 137155 states and 198934 transitions.
[2025-03-03 14:50:54,187 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 14.304347826086957) internal successors, (329), 23 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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 14:50:54,187 INFO  L276                IsEmpty]: Start isEmpty. Operand 137155 states and 198934 transitions.
[2025-03-03 14:50:54,191 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-03-03 14:50:54,191 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:54,191 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:54,202 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 14:50:54,391 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:50:54,392 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:54,392 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:54,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -306045571, now seen corresponding path program 1 times
[2025-03-03 14:50:54,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:54,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596186110]
[2025-03-03 14:50:54,392 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:54,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:54,402 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-03 14:50:54,411 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-03 14:50:54,411 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:54,411 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:54,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-03 14:50:54,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:54,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596186110]
[2025-03-03 14:50:54,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596186110] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:54,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:54,512 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:54,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791522089]
[2025-03-03 14:50:54,512 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:54,513 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:54,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:54,513 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:54,513 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:54,513 INFO  L87              Difference]: Start difference. First operand 137155 states and 198934 transitions. Second operand  has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 14:50:59,058 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:59,059 INFO  L93              Difference]: Finished difference Result 252157 states and 367417 transitions.
[2025-03-03 14:50:59,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:59,059 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 113
[2025-03-03 14:50:59,059 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:59,389 INFO  L225             Difference]: With dead ends: 252157
[2025-03-03 14:50:59,389 INFO  L226             Difference]: Without dead ends: 234779
[2025-03-03 14:50:59,462 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:59,463 INFO  L435           NwaCegarLoop]: 296 mSDtfsCounter, 1192 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:59,463 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 2105 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:59,608 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 234779 states.
[2025-03-03 14:51:03,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 234779 to 154923.
[2025-03-03 14:51:03,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 154923 states, 154922 states have (on average 1.4498263642349054) internal successors, (224610), 154922 states have internal predecessors, (224610), 0 states have call successors, (0), 0 states 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 14:51:03,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 154923 states to 154923 states and 224610 transitions.
[2025-03-03 14:51:03,576 INFO  L78                 Accepts]: Start accepts. Automaton has 154923 states and 224610 transitions. Word has length 113
[2025-03-03 14:51:03,576 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:51:03,576 INFO  L471      AbstractCegarLoop]: Abstraction has 154923 states and 224610 transitions.
[2025-03-03 14:51:03,576 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 14:51:03,576 INFO  L276                IsEmpty]: Start isEmpty. Operand 154923 states and 224610 transitions.
[2025-03-03 14:51:03,581 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2025-03-03 14:51:03,581 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:51:03,581 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:51:03,581 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 14:51:03,581 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:51:03,581 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:51:03,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 1550167457, now seen corresponding path program 1 times
[2025-03-03 14:51:03,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:51:03,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139899478]
[2025-03-03 14:51:03,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:51:03,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:51:03,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes.
[2025-03-03 14:51:03,604 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements.
[2025-03-03 14:51:03,605 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:51:03,605 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:51:03,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:51:03,673 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:51:03,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139899478]
[2025-03-03 14:51:03,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139899478] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:51:03,673 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:51:03,673 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:51:03,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630681071]
[2025-03-03 14:51:03,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:51:03,675 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:51:03,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:51:03,675 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:51:03,675 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:51:03,675 INFO  L87              Difference]: Start difference. First operand 154923 states and 224610 transitions. Second operand  has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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 14:51:05,542 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:51:05,543 INFO  L93              Difference]: Finished difference Result 221251 states and 319082 transitions.
[2025-03-03 14:51:05,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:51:05,543 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114
[2025-03-03 14:51:05,543 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:51:05,628 INFO  L225             Difference]: With dead ends: 221251
[2025-03-03 14:51:05,628 INFO  L226             Difference]: Without dead ends: 66377
[2025-03-03 14:51:05,720 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 14:51:05,721 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 63 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:51:05,721 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 336 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:51:05,763 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66377 states.