./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c --full-output --architecture 64bit


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


Checking for ERROR reachability
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 540d3c0609d7405bda84fb1e4871377b6f878aecec1441e3a226cb07c87fae75
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-07 22:25:21,454 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-07 22:25:21,497 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-07 22:25:21,501 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-07 22:25:21,503 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-07 22:25:21,524 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-07 22:25:21,525 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-07 22:25:21,525 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-07 22:25:21,526 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-07 22:25:21,526 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-07 22:25:21,527 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-07 22:25:21,527 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-07 22:25:21,527 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-07 22:25:21,527 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-07 22:25:21,527 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-07 22:25:21,528 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-07 22:25:21,528 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-07 22:25:21,528 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-07 22:25:21,528 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-07 22:25:21,528 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-07 22:25:21,528 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-07 22:25:21,528 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-07 22:25:21,528 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-07 22:25:21,528 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-07 22:25:21,528 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-07 22:25:21,529 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-07 22:25:21,529 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-07 22:25:21,529 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-07 22:25:21,529 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-07 22:25:21,529 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 22:25:21,529 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-07 22:25:21,529 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-07 22:25:21,529 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-07 22:25:21,529 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-07 22:25:21,529 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-07 22:25:21,530 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-07 22:25:21,530 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-07 22:25:21,530 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-07 22:25:21,530 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-07 22:25:21,530 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-07 22:25:21,530 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-jdk21/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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 540d3c0609d7405bda84fb1e4871377b6f878aecec1441e3a226cb07c87fae75
[2025-02-07 22:25:21,736 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-07 22:25:21,745 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-07 22:25:21,746 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-07 22:25:21,747 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-07 22:25:21,747 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-07 22:25:21,749 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c
[2025-02-07 22:25:22,895 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0b3f36d8/3da0132248944f5881262b66b8ad0e41/FLAG02ddac4c5
[2025-02-07 22:25:23,282 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-07 22:25:23,283 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c
[2025-02-07 22:25:23,299 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0b3f36d8/3da0132248944f5881262b66b8ad0e41/FLAG02ddac4c5
[2025-02-07 22:25:23,470 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0b3f36d8/3da0132248944f5881262b66b8ad0e41
[2025-02-07 22:25:23,473 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-07 22:25:23,474 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-07 22:25:23,475 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-07 22:25:23,476 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-07 22:25:23,479 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-07 22:25:23,479 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:25:23" (1/1) ...
[2025-02-07 22:25:23,480 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:23, skipping insertion in model container
[2025-02-07 22:25:23,481 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:25:23" (1/1) ...
[2025-02-07 22:25:23,524 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-07 22:25:23,643 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c[1245,1258]
[2025-02-07 22:25:23,882 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 22:25:23,889 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-07 22:25:23,895 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c[1245,1258]
[2025-02-07 22:25:24,000 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 22:25:24,010 INFO  L204         MainTranslator]: Completed translation
[2025-02-07 22:25:24,010 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24 WrapperNode
[2025-02-07 22:25:24,010 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-07 22:25:24,011 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-07 22:25:24,011 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-07 22:25:24,011 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-07 22:25:24,016 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,056 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,328 INFO  L138                Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3740
[2025-02-07 22:25:24,328 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-07 22:25:24,329 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-07 22:25:24,329 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-07 22:25:24,329 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-07 22:25:24,335 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,335 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,437 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,541 INFO  L175           MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0].
[2025-02-07 22:25:24,542 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,543 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,662 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,683 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,713 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,737 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,790 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-07 22:25:24,793 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-07 22:25:24,793 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-07 22:25:24,793 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-07 22:25:24,794 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (1/1) ...
[2025-02-07 22:25:24,798 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 22:25:24,808 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:25:24,830 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-07 22:25:24,844 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-07 22:25:24,860 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-07 22:25:24,860 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-07 22:25:24,860 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-02-07 22:25:24,860 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-07 22:25:24,860 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-07 22:25:25,143 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-07 22:25:25,145 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-07 22:25:28,202 INFO  L?                        ?]: Removed 2083 outVars from TransFormulas that were not future-live.
[2025-02-07 22:25:28,203 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-07 22:25:28,329 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-07 22:25:28,332 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-07 22:25:28,332 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:25:28 BoogieIcfgContainer
[2025-02-07 22:25:28,332 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-07 22:25:28,334 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-07 22:25:28,334 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-07 22:25:28,337 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-07 22:25:28,337 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:25:23" (1/3) ...
[2025-02-07 22:25:28,338 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c33d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:25:28, skipping insertion in model container
[2025-02-07 22:25:28,338 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:25:24" (2/3) ...
[2025-02-07 22:25:28,338 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c33d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:25:28, skipping insertion in model container
[2025-02-07 22:25:28,338 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:25:28" (3/3) ...
[2025-02-07 22:25:28,339 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal11.c
[2025-02-07 22:25:28,355 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-07 22:25:28,356 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal11.c that has 1 procedures, 1107 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-07 22:25:28,412 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-07 22:25:28,419 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;@70c66b6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-07 22:25:28,420 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-07 22:25:28,425 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1107 states, 1105 states have (on average 1.5013574660633484) internal successors, (1659), 1106 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:28,443 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 501
[2025-02-07 22:25:28,443 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:28,444 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:28,446 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:28,451 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:28,452 INFO  L85        PathProgramCache]: Analyzing trace with hash -59649345, now seen corresponding path program 1 times
[2025-02-07 22:25:28,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:28,458 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972919670]
[2025-02-07 22:25:28,458 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:28,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:28,651 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes.
[2025-02-07 22:25:30,549 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements.
[2025-02-07 22:25:30,550 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:30,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:32,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:32,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:32,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972919670]
[2025-02-07 22:25:32,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972919670] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:32,660 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:32,660 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-07 22:25:32,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332923352]
[2025-02-07 22:25:32,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:32,664 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:25:32,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:32,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:25:32,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:32,683 INFO  L87              Difference]: Start difference. First operand  has 1107 states, 1105 states have (on average 1.5013574660633484) internal successors, (1659), 1106 states have internal predecessors, (1659), 0 states have call successors, (0), 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 4 states, 4 states have (on average 125.0) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:33,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:33,370 INFO  L93              Difference]: Finished difference Result 2179 states and 3268 transitions.
[2025-02-07 22:25:33,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:25:33,372 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 125.0) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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 500
[2025-02-07 22:25:33,373 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:33,394 INFO  L225             Difference]: With dead ends: 2179
[2025-02-07 22:25:33,394 INFO  L226             Difference]: Without dead ends: 1105
[2025-02-07 22:25:33,398 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:33,399 INFO  L435           NwaCegarLoop]: 1234 mSDtfsCounter, 1204 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:33,400 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 2465 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:25:33,410 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1105 states.
[2025-02-07 22:25:33,451 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105.
[2025-02-07 22:25:33,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1105 states, 1104 states have (on average 1.4981884057971016) internal successors, (1654), 1104 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:33,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1654 transitions.
[2025-02-07 22:25:33,459 INFO  L78                 Accepts]: Start accepts. Automaton has 1105 states and 1654 transitions. Word has length 500
[2025-02-07 22:25:33,460 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:33,461 INFO  L471      AbstractCegarLoop]: Abstraction has 1105 states and 1654 transitions.
[2025-02-07 22:25:33,461 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 125.0) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:33,461 INFO  L276                IsEmpty]: Start isEmpty. Operand 1105 states and 1654 transitions.
[2025-02-07 22:25:33,466 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 503
[2025-02-07 22:25:33,466 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:33,466 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:33,466 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-07 22:25:33,466 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:33,467 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:33,467 INFO  L85        PathProgramCache]: Analyzing trace with hash -893693507, now seen corresponding path program 1 times
[2025-02-07 22:25:33,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:33,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559681637]
[2025-02-07 22:25:33,467 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:33,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:33,563 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes.
[2025-02-07 22:25:33,685 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements.
[2025-02-07 22:25:33,686 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:33,686 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:35,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:35,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:35,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559681637]
[2025-02-07 22:25:35,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559681637] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:35,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:35,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:25:35,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861250332]
[2025-02-07 22:25:35,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:35,012 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:25:35,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:35,013 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:25:35,014 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:35,014 INFO  L87              Difference]: Start difference. First operand 1105 states and 1654 transitions. Second operand  has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:35,471 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:35,471 INFO  L93              Difference]: Finished difference Result 1109 states and 1658 transitions.
[2025-02-07 22:25:35,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:25:35,472 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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 502
[2025-02-07 22:25:35,473 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:35,476 INFO  L225             Difference]: With dead ends: 1109
[2025-02-07 22:25:35,476 INFO  L226             Difference]: Without dead ends: 1107
[2025-02-07 22:25:35,477 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:35,477 INFO  L435           NwaCegarLoop]: 1378 mSDtfsCounter, 0 mSDsluCounter, 2751 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:35,478 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4129 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:25:35,479 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1107 states.
[2025-02-07 22:25:35,492 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107.
[2025-02-07 22:25:35,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1107 states, 1106 states have (on average 1.4972875226039783) internal successors, (1656), 1106 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:35,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1656 transitions.
[2025-02-07 22:25:35,496 INFO  L78                 Accepts]: Start accepts. Automaton has 1107 states and 1656 transitions. Word has length 502
[2025-02-07 22:25:35,497 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:35,497 INFO  L471      AbstractCegarLoop]: Abstraction has 1107 states and 1656 transitions.
[2025-02-07 22:25:35,497 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:35,498 INFO  L276                IsEmpty]: Start isEmpty. Operand 1107 states and 1656 transitions.
[2025-02-07 22:25:35,502 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 504
[2025-02-07 22:25:35,502 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:35,502 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:35,502 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-07 22:25:35,503 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:35,503 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:35,503 INFO  L85        PathProgramCache]: Analyzing trace with hash -1930015616, now seen corresponding path program 1 times
[2025-02-07 22:25:35,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:35,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606643127]
[2025-02-07 22:25:35,504 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:35,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:35,599 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes.
[2025-02-07 22:25:35,704 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements.
[2025-02-07 22:25:35,705 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:35,705 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:36,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:36,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:36,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606643127]
[2025-02-07 22:25:36,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606643127] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:36,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:36,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:25:36,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22291863]
[2025-02-07 22:25:36,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:36,465 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:25:36,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:36,467 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:25:36,467 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:36,467 INFO  L87              Difference]: Start difference. First operand 1107 states and 1656 transitions. Second operand  has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:36,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:36,918 INFO  L93              Difference]: Finished difference Result 2183 states and 3266 transitions.
[2025-02-07 22:25:36,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:25:36,919 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 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 503
[2025-02-07 22:25:36,920 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:36,924 INFO  L225             Difference]: With dead ends: 2183
[2025-02-07 22:25:36,925 INFO  L226             Difference]: Without dead ends: 1109
[2025-02-07 22:25:36,926 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:36,926 INFO  L435           NwaCegarLoop]: 1378 mSDtfsCounter, 0 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:36,926 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4126 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:25:36,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1109 states.
[2025-02-07 22:25:36,938 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109.
[2025-02-07 22:25:36,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1109 states, 1108 states have (on average 1.4963898916967509) internal successors, (1658), 1108 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:36,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1658 transitions.
[2025-02-07 22:25:36,942 INFO  L78                 Accepts]: Start accepts. Automaton has 1109 states and 1658 transitions. Word has length 503
[2025-02-07 22:25:36,942 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:36,942 INFO  L471      AbstractCegarLoop]: Abstraction has 1109 states and 1658 transitions.
[2025-02-07 22:25:36,943 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:36,943 INFO  L276                IsEmpty]: Start isEmpty. Operand 1109 states and 1658 transitions.
[2025-02-07 22:25:36,948 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 505
[2025-02-07 22:25:36,948 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:36,948 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:36,948 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-07 22:25:36,948 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:36,949 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:36,949 INFO  L85        PathProgramCache]: Analyzing trace with hash -2064399848, now seen corresponding path program 1 times
[2025-02-07 22:25:36,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:36,949 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034495413]
[2025-02-07 22:25:36,949 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:36,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:37,033 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes.
[2025-02-07 22:25:37,880 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements.
[2025-02-07 22:25:37,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:37,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:38,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:38,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:38,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034495413]
[2025-02-07 22:25:38,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034495413] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:38,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:38,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:25:38,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340871767]
[2025-02-07 22:25:38,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:38,766 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:25:38,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:38,767 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:25:38,767 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:38,767 INFO  L87              Difference]: Start difference. First operand 1109 states and 1658 transitions. Second operand  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:39,350 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:39,351 INFO  L93              Difference]: Finished difference Result 2185 states and 3267 transitions.
[2025-02-07 22:25:39,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:25:39,351 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 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 504
[2025-02-07 22:25:39,352 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:39,355 INFO  L225             Difference]: With dead ends: 2185
[2025-02-07 22:25:39,355 INFO  L226             Difference]: Without dead ends: 1109
[2025-02-07 22:25:39,356 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:39,357 INFO  L435           NwaCegarLoop]: 1234 mSDtfsCounter, 1642 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:39,357 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 2465 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:25:39,359 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1109 states.
[2025-02-07 22:25:39,370 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109.
[2025-02-07 22:25:39,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1109 states, 1108 states have (on average 1.4954873646209386) internal successors, (1657), 1108 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:39,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1657 transitions.
[2025-02-07 22:25:39,375 INFO  L78                 Accepts]: Start accepts. Automaton has 1109 states and 1657 transitions. Word has length 504
[2025-02-07 22:25:39,375 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:39,375 INFO  L471      AbstractCegarLoop]: Abstraction has 1109 states and 1657 transitions.
[2025-02-07 22:25:39,376 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:39,376 INFO  L276                IsEmpty]: Start isEmpty. Operand 1109 states and 1657 transitions.
[2025-02-07 22:25:39,382 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 506
[2025-02-07 22:25:39,382 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:39,382 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:39,383 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-07 22:25:39,383 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:39,383 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:39,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -8180784, now seen corresponding path program 1 times
[2025-02-07 22:25:39,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:39,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587181199]
[2025-02-07 22:25:39,384 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:39,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:39,485 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes.
[2025-02-07 22:25:40,272 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements.
[2025-02-07 22:25:40,272 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:40,272 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:40,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:40,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:40,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587181199]
[2025-02-07 22:25:40,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587181199] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:40,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:40,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:25:40,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854834159]
[2025-02-07 22:25:40,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:40,787 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:25:40,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:40,788 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:25:40,788 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:25:40,788 INFO  L87              Difference]: Start difference. First operand 1109 states and 1657 transitions. Second operand  has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:41,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:41,983 INFO  L93              Difference]: Finished difference Result 4054 states and 6063 transitions.
[2025-02-07 22:25:41,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:25:41,984 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 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 505
[2025-02-07 22:25:41,985 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:41,992 INFO  L225             Difference]: With dead ends: 4054
[2025-02-07 22:25:41,992 INFO  L226             Difference]: Without dead ends: 2173
[2025-02-07 22:25:41,994 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:25:41,995 INFO  L435           NwaCegarLoop]: 1648 mSDtfsCounter, 3542 mSDsluCounter, 7058 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3542 SdHoareTripleChecker+Valid, 8706 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:41,996 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3542 Valid, 8706 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-07 22:25:41,998 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2173 states.
[2025-02-07 22:25:42,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1131.
[2025-02-07 22:25:42,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1131 states, 1130 states have (on average 1.4946902654867256) internal successors, (1689), 1130 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:42,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1689 transitions.
[2025-02-07 22:25:42,017 INFO  L78                 Accepts]: Start accepts. Automaton has 1131 states and 1689 transitions. Word has length 505
[2025-02-07 22:25:42,017 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:42,017 INFO  L471      AbstractCegarLoop]: Abstraction has 1131 states and 1689 transitions.
[2025-02-07 22:25:42,017 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:42,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 1131 states and 1689 transitions.
[2025-02-07 22:25:42,020 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 507
[2025-02-07 22:25:42,020 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:42,020 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:42,020 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-07 22:25:42,020 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:42,021 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:42,022 INFO  L85        PathProgramCache]: Analyzing trace with hash -1335607606, now seen corresponding path program 1 times
[2025-02-07 22:25:42,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:42,022 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238048097]
[2025-02-07 22:25:42,022 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:42,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:42,100 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes.
[2025-02-07 22:25:43,812 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements.
[2025-02-07 22:25:43,813 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:43,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:44,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:44,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:44,487 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238048097]
[2025-02-07 22:25:44,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238048097] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:44,487 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:44,487 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:25:44,487 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197571232]
[2025-02-07 22:25:44,487 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:44,489 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:25:44,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:44,490 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:25:44,490 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:25:44,492 INFO  L87              Difference]: Start difference. First operand 1131 states and 1689 transitions. Second operand  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:45,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:45,923 INFO  L93              Difference]: Finished difference Result 3293 states and 4919 transitions.
[2025-02-07 22:25:45,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:25:45,924 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 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 506
[2025-02-07 22:25:45,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:45,930 INFO  L225             Difference]: With dead ends: 3293
[2025-02-07 22:25:45,930 INFO  L226             Difference]: Without dead ends: 2195
[2025-02-07 22:25:45,931 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:25:45,933 INFO  L435           NwaCegarLoop]: 2431 mSDtfsCounter, 3204 mSDsluCounter, 6074 mSDsCounter, 0 mSdLazyCounter, 2856 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3204 SdHoareTripleChecker+Valid, 8505 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:45,933 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3204 Valid, 8505 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2856 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-07 22:25:45,937 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2195 states.
[2025-02-07 22:25:45,949 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1154.
[2025-02-07 22:25:45,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1154 states, 1153 states have (on average 1.4934952298352124) internal successors, (1722), 1153 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:45,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1722 transitions.
[2025-02-07 22:25:45,953 INFO  L78                 Accepts]: Start accepts. Automaton has 1154 states and 1722 transitions. Word has length 506
[2025-02-07 22:25:45,953 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:45,953 INFO  L471      AbstractCegarLoop]: Abstraction has 1154 states and 1722 transitions.
[2025-02-07 22:25:45,953 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:45,953 INFO  L276                IsEmpty]: Start isEmpty. Operand 1154 states and 1722 transitions.
[2025-02-07 22:25:45,956 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 507
[2025-02-07 22:25:45,956 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:45,957 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:45,957 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-07 22:25:45,957 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:45,958 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:45,958 INFO  L85        PathProgramCache]: Analyzing trace with hash 1788419240, now seen corresponding path program 1 times
[2025-02-07 22:25:45,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:45,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226533239]
[2025-02-07 22:25:45,958 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:45,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:46,033 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes.
[2025-02-07 22:25:48,238 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements.
[2025-02-07 22:25:48,239 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:48,239 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:48,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:48,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:48,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226533239]
[2025-02-07 22:25:48,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226533239] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:48,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:48,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:25:48,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216276114]
[2025-02-07 22:25:48,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:48,818 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:25:48,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:48,819 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:25:48,819 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:25:48,819 INFO  L87              Difference]: Start difference. First operand 1154 states and 1722 transitions. Second operand  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:50,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:50,003 INFO  L93              Difference]: Finished difference Result 3317 states and 4952 transitions.
[2025-02-07 22:25:50,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:25:50,004 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 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 506
[2025-02-07 22:25:50,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:50,009 INFO  L225             Difference]: With dead ends: 3317
[2025-02-07 22:25:50,009 INFO  L226             Difference]: Without dead ends: 2196
[2025-02-07 22:25:50,010 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:25:50,012 INFO  L435           NwaCegarLoop]: 2409 mSDtfsCounter, 3225 mSDsluCounter, 6032 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3225 SdHoareTripleChecker+Valid, 8441 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:50,012 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3225 Valid, 8441 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2821 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-07 22:25:50,015 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2196 states.
[2025-02-07 22:25:50,027 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1132.
[2025-02-07 22:25:50,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1132 states, 1131 states have (on average 1.4942528735632183) internal successors, (1690), 1131 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:50,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1690 transitions.
[2025-02-07 22:25:50,030 INFO  L78                 Accepts]: Start accepts. Automaton has 1132 states and 1690 transitions. Word has length 506
[2025-02-07 22:25:50,030 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:50,030 INFO  L471      AbstractCegarLoop]: Abstraction has 1132 states and 1690 transitions.
[2025-02-07 22:25:50,030 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:50,030 INFO  L276                IsEmpty]: Start isEmpty. Operand 1132 states and 1690 transitions.
[2025-02-07 22:25:50,033 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 508
[2025-02-07 22:25:50,033 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:50,033 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:50,033 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-07 22:25:50,033 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:50,034 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:50,034 INFO  L85        PathProgramCache]: Analyzing trace with hash -1900077717, now seen corresponding path program 1 times
[2025-02-07 22:25:50,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:50,035 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204532457]
[2025-02-07 22:25:50,035 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:50,035 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:50,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes.
[2025-02-07 22:25:52,184 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements.
[2025-02-07 22:25:52,184 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:52,184 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:53,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:53,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:53,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204532457]
[2025-02-07 22:25:53,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204532457] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:53,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:53,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:25:53,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178045182]
[2025-02-07 22:25:53,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:53,262 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:25:53,262 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:53,262 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:25:53,263 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:25:53,263 INFO  L87              Difference]: Start difference. First operand 1132 states and 1690 transitions. Second operand  has 7 states, 7 states have (on average 72.42857142857143) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:54,188 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:54,188 INFO  L93              Difference]: Finished difference Result 2400 states and 3580 transitions.
[2025-02-07 22:25:54,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:25:54,188 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 72.42857142857143) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 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 507
[2025-02-07 22:25:54,193 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:54,195 INFO  L225             Difference]: With dead ends: 2400
[2025-02-07 22:25:54,195 INFO  L226             Difference]: Without dead ends: 1301
[2025-02-07 22:25:54,196 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:25:54,197 INFO  L435           NwaCegarLoop]: 1353 mSDtfsCounter, 2682 mSDsluCounter, 3924 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 5277 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:54,197 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 5277 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-07 22:25:54,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1301 states.
[2025-02-07 22:25:54,208 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1166.
[2025-02-07 22:25:54,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1166 states, 1165 states have (on average 1.4935622317596566) internal successors, (1740), 1165 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:54,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1740 transitions.
[2025-02-07 22:25:54,211 INFO  L78                 Accepts]: Start accepts. Automaton has 1166 states and 1740 transitions. Word has length 507
[2025-02-07 22:25:54,212 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:54,212 INFO  L471      AbstractCegarLoop]: Abstraction has 1166 states and 1740 transitions.
[2025-02-07 22:25:54,212 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 72.42857142857143) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:54,212 INFO  L276                IsEmpty]: Start isEmpty. Operand 1166 states and 1740 transitions.
[2025-02-07 22:25:54,214 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 509
[2025-02-07 22:25:54,214 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:54,214 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:54,216 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-07 22:25:54,216 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:54,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:54,217 INFO  L85        PathProgramCache]: Analyzing trace with hash -1769541394, now seen corresponding path program 1 times
[2025-02-07 22:25:54,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:54,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003941206]
[2025-02-07 22:25:54,217 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:54,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:54,308 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes.
[2025-02-07 22:25:56,210 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements.
[2025-02-07 22:25:56,210 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:56,210 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:57,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:57,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:57,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003941206]
[2025-02-07 22:25:57,118 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003941206] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:57,118 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:57,118 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:25:57,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926990385]
[2025-02-07 22:25:57,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:57,118 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:25:57,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:57,119 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:25:57,119 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:25:57,119 INFO  L87              Difference]: Start difference. First operand 1166 states and 1740 transitions. Second operand  has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:57,793 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:57,793 INFO  L93              Difference]: Finished difference Result 2299 states and 3431 transitions.
[2025-02-07 22:25:57,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:25:57,794 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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 508
[2025-02-07 22:25:57,794 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:57,796 INFO  L225             Difference]: With dead ends: 2299
[2025-02-07 22:25:57,796 INFO  L226             Difference]: Without dead ends: 1166
[2025-02-07 22:25:57,797 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:25:57,801 INFO  L435           NwaCegarLoop]: 1229 mSDtfsCounter, 3190 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3190 SdHoareTripleChecker+Valid, 3710 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:57,801 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3190 Valid, 3710 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:25:57,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1166 states.
[2025-02-07 22:25:57,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1143.
[2025-02-07 22:25:57,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1143 states, 1142 states have (on average 1.4929947460595447) internal successors, (1705), 1142 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:57,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1705 transitions.
[2025-02-07 22:25:57,813 INFO  L78                 Accepts]: Start accepts. Automaton has 1143 states and 1705 transitions. Word has length 508
[2025-02-07 22:25:57,813 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:57,813 INFO  L471      AbstractCegarLoop]: Abstraction has 1143 states and 1705 transitions.
[2025-02-07 22:25:57,813 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:57,813 INFO  L276                IsEmpty]: Start isEmpty. Operand 1143 states and 1705 transitions.
[2025-02-07 22:25:57,816 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 509
[2025-02-07 22:25:57,816 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:57,816 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:57,816 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-07 22:25:57,816 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:57,819 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:57,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -1704357379, now seen corresponding path program 1 times
[2025-02-07 22:25:57,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:57,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118298760]
[2025-02-07 22:25:57,823 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:57,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:25:57,944 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes.
[2025-02-07 22:25:58,764 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements.
[2025-02-07 22:25:58,764 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:25:58,764 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:25:59,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:25:59,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:25:59,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118298760]
[2025-02-07 22:25:59,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118298760] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:25:59,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:25:59,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:25:59,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147448581]
[2025-02-07 22:25:59,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:25:59,484 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:25:59,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:25:59,484 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:25:59,484 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:59,485 INFO  L87              Difference]: Start difference. First operand 1143 states and 1705 transitions. Second operand  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:59,908 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:25:59,909 INFO  L93              Difference]: Finished difference Result 2253 states and 3361 transitions.
[2025-02-07 22:25:59,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:25:59,909 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 508
[2025-02-07 22:25:59,914 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:25:59,916 INFO  L225             Difference]: With dead ends: 2253
[2025-02-07 22:25:59,916 INFO  L226             Difference]: Without dead ends: 1143
[2025-02-07 22:25:59,917 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:25:59,917 INFO  L435           NwaCegarLoop]: 1234 mSDtfsCounter, 1201 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:25:59,918 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 2465 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:25:59,919 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1143 states.
[2025-02-07 22:25:59,928 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143.
[2025-02-07 22:25:59,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1143 states, 1142 states have (on average 1.4912434325744308) internal successors, (1703), 1142 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:59,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1703 transitions.
[2025-02-07 22:25:59,930 INFO  L78                 Accepts]: Start accepts. Automaton has 1143 states and 1703 transitions. Word has length 508
[2025-02-07 22:25:59,931 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:25:59,931 INFO  L471      AbstractCegarLoop]: Abstraction has 1143 states and 1703 transitions.
[2025-02-07 22:25:59,931 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:25:59,931 INFO  L276                IsEmpty]: Start isEmpty. Operand 1143 states and 1703 transitions.
[2025-02-07 22:25:59,933 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 510
[2025-02-07 22:25:59,933 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:25:59,933 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:25:59,934 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-07 22:25:59,934 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:25:59,934 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:25:59,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 1780982408, now seen corresponding path program 1 times
[2025-02-07 22:25:59,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:25:59,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634282845]
[2025-02-07 22:25:59,935 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:25:59,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:00,005 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes.
[2025-02-07 22:26:01,510 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements.
[2025-02-07 22:26:01,510 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:01,510 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:02,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:02,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:02,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634282845]
[2025-02-07 22:26:02,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634282845] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:02,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:02,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-07 22:26:02,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263798226]
[2025-02-07 22:26:02,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:02,667 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 22:26:02,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:02,667 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 22:26:02,667 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:26:02,667 INFO  L87              Difference]: Start difference. First operand 1143 states and 1703 transitions. Second operand  has 8 states, 8 states have (on average 63.625) internal successors, (509), 7 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:03,644 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:03,644 INFO  L93              Difference]: Finished difference Result 2755 states and 4108 transitions.
[2025-02-07 22:26:03,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 22:26:03,645 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 63.625) internal successors, (509), 7 states have internal predecessors, (509), 0 states have call successors, (0), 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 509
[2025-02-07 22:26:03,645 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:03,649 INFO  L225             Difference]: With dead ends: 2755
[2025-02-07 22:26:03,649 INFO  L226             Difference]: Without dead ends: 1645
[2025-02-07 22:26:03,650 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:26:03,650 INFO  L435           NwaCegarLoop]: 1314 mSDtfsCounter, 2716 mSDsluCounter, 6314 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2716 SdHoareTripleChecker+Valid, 7628 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:03,651 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2716 Valid, 7628 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-07 22:26:03,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1645 states.
[2025-02-07 22:26:03,666 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1612.
[2025-02-07 22:26:03,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1612 states, 1611 states have (on average 1.4928615766604594) internal successors, (2405), 1611 states have internal predecessors, (2405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:03,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2405 transitions.
[2025-02-07 22:26:03,670 INFO  L78                 Accepts]: Start accepts. Automaton has 1612 states and 2405 transitions. Word has length 509
[2025-02-07 22:26:03,670 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:03,670 INFO  L471      AbstractCegarLoop]: Abstraction has 1612 states and 2405 transitions.
[2025-02-07 22:26:03,671 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 63.625) internal successors, (509), 7 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:03,671 INFO  L276                IsEmpty]: Start isEmpty. Operand 1612 states and 2405 transitions.
[2025-02-07 22:26:03,674 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 511
[2025-02-07 22:26:03,674 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:03,674 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:03,674 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-07 22:26:03,674 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:03,674 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:03,675 INFO  L85        PathProgramCache]: Analyzing trace with hash 183752446, now seen corresponding path program 1 times
[2025-02-07 22:26:03,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:03,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940649272]
[2025-02-07 22:26:03,675 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:03,675 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:03,752 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes.
[2025-02-07 22:26:05,781 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements.
[2025-02-07 22:26:05,782 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:05,782 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:06,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:06,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:06,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940649272]
[2025-02-07 22:26:06,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940649272] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:06,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:06,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:26:06,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190005621]
[2025-02-07 22:26:06,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:06,399 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:26:06,399 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:06,399 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:26:06,399 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:26:06,399 INFO  L87              Difference]: Start difference. First operand 1612 states and 2405 transitions. Second operand  has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:06,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:06,872 INFO  L93              Difference]: Finished difference Result 3191 states and 4761 transitions.
[2025-02-07 22:26:06,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:26:06,873 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 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 510
[2025-02-07 22:26:06,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:06,876 INFO  L225             Difference]: With dead ends: 3191
[2025-02-07 22:26:06,876 INFO  L226             Difference]: Without dead ends: 1612
[2025-02-07 22:26:06,878 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:26:06,878 INFO  L435           NwaCegarLoop]: 1234 mSDtfsCounter, 1190 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:06,878 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 2465 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:26:06,879 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1612 states.
[2025-02-07 22:26:06,890 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1578.
[2025-02-07 22:26:06,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1578 states, 1577 states have (on average 1.4933417882054534) internal successors, (2355), 1577 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:06,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2355 transitions.
[2025-02-07 22:26:06,894 INFO  L78                 Accepts]: Start accepts. Automaton has 1578 states and 2355 transitions. Word has length 510
[2025-02-07 22:26:06,894 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:06,894 INFO  L471      AbstractCegarLoop]: Abstraction has 1578 states and 2355 transitions.
[2025-02-07 22:26:06,894 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:06,894 INFO  L276                IsEmpty]: Start isEmpty. Operand 1578 states and 2355 transitions.
[2025-02-07 22:26:06,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 511
[2025-02-07 22:26:06,897 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:06,897 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:06,897 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-07 22:26:06,897 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:06,898 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:06,898 INFO  L85        PathProgramCache]: Analyzing trace with hash 747590489, now seen corresponding path program 1 times
[2025-02-07 22:26:06,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:06,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956806447]
[2025-02-07 22:26:06,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:06,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:06,970 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes.
[2025-02-07 22:26:09,651 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements.
[2025-02-07 22:26:09,651 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:09,651 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:10,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:10,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:10,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956806447]
[2025-02-07 22:26:10,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956806447] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:10,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:10,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:26:10,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608949746]
[2025-02-07 22:26:10,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:10,649 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:26:10,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:10,649 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:26:10,649 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:26:10,650 INFO  L87              Difference]: Start difference. First operand 1578 states and 2355 transitions. Second operand  has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:11,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:11,847 INFO  L93              Difference]: Finished difference Result 3129 states and 4670 transitions.
[2025-02-07 22:26:11,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-07 22:26:11,847 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 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 510
[2025-02-07 22:26:11,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:11,851 INFO  L225             Difference]: With dead ends: 3129
[2025-02-07 22:26:11,852 INFO  L226             Difference]: Without dead ends: 1584
[2025-02-07 22:26:11,853 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:26:11,853 INFO  L435           NwaCegarLoop]: 972 mSDtfsCounter, 1390 mSDsluCounter, 3880 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 4852 SdHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:11,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 4852 Invalid, 3392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-07 22:26:11,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1584 states.
[2025-02-07 22:26:11,867 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1583.
[2025-02-07 22:26:11,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1583 states, 1582 states have (on average 1.4924146649810366) internal successors, (2361), 1582 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:11,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2361 transitions.
[2025-02-07 22:26:11,875 INFO  L78                 Accepts]: Start accepts. Automaton has 1583 states and 2361 transitions. Word has length 510
[2025-02-07 22:26:11,875 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:11,875 INFO  L471      AbstractCegarLoop]: Abstraction has 1583 states and 2361 transitions.
[2025-02-07 22:26:11,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:11,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 1583 states and 2361 transitions.
[2025-02-07 22:26:11,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 511
[2025-02-07 22:26:11,878 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:11,879 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:11,879 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-07 22:26:11,879 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:11,879 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:11,879 INFO  L85        PathProgramCache]: Analyzing trace with hash -1587994398, now seen corresponding path program 1 times
[2025-02-07 22:26:11,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:11,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424753975]
[2025-02-07 22:26:11,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:11,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:11,956 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes.
[2025-02-07 22:26:14,696 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements.
[2025-02-07 22:26:14,696 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:14,696 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:15,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:15,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:15,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424753975]
[2025-02-07 22:26:15,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424753975] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:15,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:15,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:26:15,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11288278]
[2025-02-07 22:26:15,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:15,925 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:26:15,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:15,925 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:26:15,926 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:26:15,926 INFO  L87              Difference]: Start difference. First operand 1583 states and 2361 transitions. Second operand  has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:16,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:16,499 INFO  L93              Difference]: Finished difference Result 4367 states and 6520 transitions.
[2025-02-07 22:26:16,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 22:26:16,500 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 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 510
[2025-02-07 22:26:16,500 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:16,505 INFO  L225             Difference]: With dead ends: 4367
[2025-02-07 22:26:16,505 INFO  L226             Difference]: Without dead ends: 2817
[2025-02-07 22:26:16,506 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:26:16,506 INFO  L435           NwaCegarLoop]: 1361 mSDtfsCounter, 3668 mSDsluCounter, 5427 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3668 SdHoareTripleChecker+Valid, 6788 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:16,507 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3668 Valid, 6788 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:26:16,508 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2817 states.
[2025-02-07 22:26:16,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2602.
[2025-02-07 22:26:16,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2602 states, 2601 states have (on average 1.4936562860438294) internal successors, (3885), 2601 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:16,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 3885 transitions.
[2025-02-07 22:26:16,525 INFO  L78                 Accepts]: Start accepts. Automaton has 2602 states and 3885 transitions. Word has length 510
[2025-02-07 22:26:16,526 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:16,526 INFO  L471      AbstractCegarLoop]: Abstraction has 2602 states and 3885 transitions.
[2025-02-07 22:26:16,527 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:16,527 INFO  L276                IsEmpty]: Start isEmpty. Operand 2602 states and 3885 transitions.
[2025-02-07 22:26:16,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 512
[2025-02-07 22:26:16,530 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:16,530 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:16,531 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-07 22:26:16,531 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:16,531 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:16,531 INFO  L85        PathProgramCache]: Analyzing trace with hash -1614878931, now seen corresponding path program 1 times
[2025-02-07 22:26:16,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:16,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91580041]
[2025-02-07 22:26:16,531 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:16,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:16,602 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes.
[2025-02-07 22:26:18,162 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements.
[2025-02-07 22:26:18,163 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:18,163 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:18,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:18,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:18,760 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91580041]
[2025-02-07 22:26:18,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91580041] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:18,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:18,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-07 22:26:18,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220746523]
[2025-02-07 22:26:18,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:18,760 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:26:18,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:18,761 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:26:18,761 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:26:18,761 INFO  L87              Difference]: Start difference. First operand 2602 states and 3885 transitions. Second operand  has 4 states, 4 states have (on average 127.75) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:19,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:19,250 INFO  L93              Difference]: Finished difference Result 5171 states and 7721 transitions.
[2025-02-07 22:26:19,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:26:19,251 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 127.75) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 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 511
[2025-02-07 22:26:19,252 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:19,257 INFO  L225             Difference]: With dead ends: 5171
[2025-02-07 22:26:19,257 INFO  L226             Difference]: Without dead ends: 2602
[2025-02-07 22:26:19,258 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:26:19,259 INFO  L435           NwaCegarLoop]: 1234 mSDtfsCounter, 1164 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:19,259 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 2465 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:26:19,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2602 states.
[2025-02-07 22:26:19,285 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602.
[2025-02-07 22:26:19,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2602 states, 2601 states have (on average 1.493271818531334) internal successors, (3884), 2601 states have internal predecessors, (3884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:19,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 3884 transitions.
[2025-02-07 22:26:19,289 INFO  L78                 Accepts]: Start accepts. Automaton has 2602 states and 3884 transitions. Word has length 511
[2025-02-07 22:26:19,290 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:19,290 INFO  L471      AbstractCegarLoop]: Abstraction has 2602 states and 3884 transitions.
[2025-02-07 22:26:19,290 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 127.75) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:19,290 INFO  L276                IsEmpty]: Start isEmpty. Operand 2602 states and 3884 transitions.
[2025-02-07 22:26:19,301 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 513
[2025-02-07 22:26:19,302 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:19,302 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:19,302 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-07 22:26:19,302 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:19,302 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:19,302 INFO  L85        PathProgramCache]: Analyzing trace with hash -151107748, now seen corresponding path program 1 times
[2025-02-07 22:26:19,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:19,302 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020500623]
[2025-02-07 22:26:19,302 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:19,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:19,379 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes.
[2025-02-07 22:26:21,108 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements.
[2025-02-07 22:26:21,109 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:21,109 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:22,112 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:22,112 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:22,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020500623]
[2025-02-07 22:26:22,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020500623] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:22,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:22,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-07 22:26:22,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013508284]
[2025-02-07 22:26:22,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:22,113 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-07 22:26:22,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:22,114 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-07 22:26:22,114 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:26:22,114 INFO  L87              Difference]: Start difference. First operand 2602 states and 3884 transitions. Second operand  has 9 states, 9 states have (on average 56.888888888888886) internal successors, (512), 9 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:24,069 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:24,069 INFO  L93              Difference]: Finished difference Result 5179 states and 7731 transitions.
[2025-02-07 22:26:24,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 22:26:24,069 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 56.888888888888886) internal successors, (512), 9 states have internal predecessors, (512), 0 states have call successors, (0), 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 512
[2025-02-07 22:26:24,070 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:24,074 INFO  L225             Difference]: With dead ends: 5179
[2025-02-07 22:26:24,074 INFO  L226             Difference]: Without dead ends: 2610
[2025-02-07 22:26:24,075 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:26:24,076 INFO  L435           NwaCegarLoop]: 972 mSDtfsCounter, 2430 mSDsluCounter, 4850 mSDsCounter, 0 mSdLazyCounter, 4062 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2430 SdHoareTripleChecker+Valid, 5822 SdHoareTripleChecker+Invalid, 4065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:24,076 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2430 Valid, 5822 Invalid, 4065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4062 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-07 22:26:24,077 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2610 states.
[2025-02-07 22:26:24,114 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2607.
[2025-02-07 22:26:24,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2607 states, 2606 states have (on average 1.4927091327705295) internal successors, (3890), 2606 states have internal predecessors, (3890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:24,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3890 transitions.
[2025-02-07 22:26:24,118 INFO  L78                 Accepts]: Start accepts. Automaton has 2607 states and 3890 transitions. Word has length 512
[2025-02-07 22:26:24,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:24,118 INFO  L471      AbstractCegarLoop]: Abstraction has 2607 states and 3890 transitions.
[2025-02-07 22:26:24,119 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 56.888888888888886) internal successors, (512), 9 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:24,119 INFO  L276                IsEmpty]: Start isEmpty. Operand 2607 states and 3890 transitions.
[2025-02-07 22:26:24,122 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 514
[2025-02-07 22:26:24,122 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:24,122 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:24,122 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-07 22:26:24,122 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:24,123 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:24,123 INFO  L85        PathProgramCache]: Analyzing trace with hash 507715850, now seen corresponding path program 1 times
[2025-02-07 22:26:24,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:24,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784990717]
[2025-02-07 22:26:24,123 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:24,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:24,193 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes.
[2025-02-07 22:26:25,992 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements.
[2025-02-07 22:26:25,992 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:25,992 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:27,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:27,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:27,022 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784990717]
[2025-02-07 22:26:27,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784990717] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:27,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:27,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:26:27,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873567867]
[2025-02-07 22:26:27,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:27,023 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:26:27,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:27,023 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:26:27,023 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:26:27,023 INFO  L87              Difference]: Start difference. First operand 2607 states and 3890 transitions. Second operand  has 6 states, 6 states have (on average 85.5) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:27,801 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:27,801 INFO  L93              Difference]: Finished difference Result 5350 states and 7977 transitions.
[2025-02-07 22:26:27,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:26:27,802 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 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 513
[2025-02-07 22:26:27,802 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:27,808 INFO  L225             Difference]: With dead ends: 5350
[2025-02-07 22:26:27,808 INFO  L226             Difference]: Without dead ends: 2776
[2025-02-07 22:26:27,810 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:26:27,811 INFO  L435           NwaCegarLoop]: 1353 mSDtfsCounter, 1426 mSDsluCounter, 3924 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 5277 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:27,811 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 5277 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-07 22:26:27,813 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2776 states.
[2025-02-07 22:26:27,832 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2642.
[2025-02-07 22:26:27,834 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2642 states, 2641 states have (on average 1.4914804998106779) internal successors, (3939), 2641 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:27,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3939 transitions.
[2025-02-07 22:26:27,836 INFO  L78                 Accepts]: Start accepts. Automaton has 2642 states and 3939 transitions. Word has length 513
[2025-02-07 22:26:27,836 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:27,836 INFO  L471      AbstractCegarLoop]: Abstraction has 2642 states and 3939 transitions.
[2025-02-07 22:26:27,836 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:27,836 INFO  L276                IsEmpty]: Start isEmpty. Operand 2642 states and 3939 transitions.
[2025-02-07 22:26:27,839 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 515
[2025-02-07 22:26:27,839 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:27,839 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:27,840 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-07 22:26:27,840 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:27,840 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:27,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 1280774433, now seen corresponding path program 1 times
[2025-02-07 22:26:27,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:27,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721161628]
[2025-02-07 22:26:27,840 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:27,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:27,917 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes.
[2025-02-07 22:26:30,113 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements.
[2025-02-07 22:26:30,114 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:30,114 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:31,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:31,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:31,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721161628]
[2025-02-07 22:26:31,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721161628] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:31,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:31,406 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-07 22:26:31,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588046391]
[2025-02-07 22:26:31,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:31,407 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-07 22:26:31,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:31,407 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-07 22:26:31,407 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:26:31,407 INFO  L87              Difference]: Start difference. First operand 2642 states and 3939 transitions. Second operand  has 9 states, 9 states have (on average 57.111111111111114) internal successors, (514), 9 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:32,810 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:32,811 INFO  L93              Difference]: Finished difference Result 6739 states and 10055 transitions.
[2025-02-07 22:26:32,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 22:26:32,811 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 57.111111111111114) internal successors, (514), 9 states have internal predecessors, (514), 0 states have call successors, (0), 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 514
[2025-02-07 22:26:32,812 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:32,817 INFO  L225             Difference]: With dead ends: 6739
[2025-02-07 22:26:32,817 INFO  L226             Difference]: Without dead ends: 4130
[2025-02-07 22:26:32,819 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182
[2025-02-07 22:26:32,819 INFO  L435           NwaCegarLoop]: 971 mSDtfsCounter, 3746 mSDsluCounter, 3870 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3746 SdHoareTripleChecker+Valid, 4841 SdHoareTripleChecker+Invalid, 3408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:32,820 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3746 Valid, 4841 Invalid, 3408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-07 22:26:32,821 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4130 states.
[2025-02-07 22:26:32,836 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 2646.
[2025-02-07 22:26:32,838 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2646 states, 2645 states have (on average 1.4914933837429112) internal successors, (3945), 2645 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:32,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3945 transitions.
[2025-02-07 22:26:32,840 INFO  L78                 Accepts]: Start accepts. Automaton has 2646 states and 3945 transitions. Word has length 514
[2025-02-07 22:26:32,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:32,840 INFO  L471      AbstractCegarLoop]: Abstraction has 2646 states and 3945 transitions.
[2025-02-07 22:26:32,840 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 57.111111111111114) internal successors, (514), 9 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:32,840 INFO  L276                IsEmpty]: Start isEmpty. Operand 2646 states and 3945 transitions.
[2025-02-07 22:26:32,843 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 516
[2025-02-07 22:26:32,843 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:32,844 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:32,844 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-07 22:26:32,844 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:32,844 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:32,844 INFO  L85        PathProgramCache]: Analyzing trace with hash 156435544, now seen corresponding path program 1 times
[2025-02-07 22:26:32,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:32,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920658130]
[2025-02-07 22:26:32,845 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:32,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:32,919 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes.
[2025-02-07 22:26:35,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements.
[2025-02-07 22:26:35,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:35,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:36,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:36,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:36,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920658130]
[2025-02-07 22:26:36,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920658130] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:36,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:36,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 22:26:36,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137263616]
[2025-02-07 22:26:36,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:36,324 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 22:26:36,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:36,324 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 22:26:36,324 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:26:36,325 INFO  L87              Difference]: Start difference. First operand 2646 states and 3945 transitions. Second operand  has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:37,757 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:37,757 INFO  L93              Difference]: Finished difference Result 6266 states and 9332 transitions.
[2025-02-07 22:26:37,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-07 22:26:37,757 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 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 515
[2025-02-07 22:26:37,758 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:37,763 INFO  L225             Difference]: With dead ends: 6266
[2025-02-07 22:26:37,763 INFO  L226             Difference]: Without dead ends: 3649
[2025-02-07 22:26:37,765 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210
[2025-02-07 22:26:37,765 INFO  L435           NwaCegarLoop]: 1929 mSDtfsCounter, 2291 mSDsluCounter, 9347 mSDsCounter, 0 mSdLazyCounter, 3126 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 11276 SdHoareTripleChecker+Invalid, 3184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:37,765 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 11276 Invalid, 3184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3126 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-07 22:26:37,767 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3649 states.
[2025-02-07 22:26:37,781 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 2622.
[2025-02-07 22:26:37,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2622 states, 2621 states have (on average 1.4631819916062572) internal successors, (3835), 2621 states have internal predecessors, (3835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:37,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3835 transitions.
[2025-02-07 22:26:37,784 INFO  L78                 Accepts]: Start accepts. Automaton has 2622 states and 3835 transitions. Word has length 515
[2025-02-07 22:26:37,785 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:37,785 INFO  L471      AbstractCegarLoop]: Abstraction has 2622 states and 3835 transitions.
[2025-02-07 22:26:37,785 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:37,785 INFO  L276                IsEmpty]: Start isEmpty. Operand 2622 states and 3835 transitions.
[2025-02-07 22:26:37,787 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 516
[2025-02-07 22:26:37,787 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:37,787 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:37,788 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-07 22:26:37,788 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:37,788 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:37,788 INFO  L85        PathProgramCache]: Analyzing trace with hash -174246167, now seen corresponding path program 1 times
[2025-02-07 22:26:37,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:37,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298701218]
[2025-02-07 22:26:37,788 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:37,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:37,927 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes.
[2025-02-07 22:26:40,850 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements.
[2025-02-07 22:26:40,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:40,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:42,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:42,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:42,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298701218]
[2025-02-07 22:26:42,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298701218] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:42,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:42,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:26:42,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200944254]
[2025-02-07 22:26:42,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:42,128 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:26:42,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:42,129 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:26:42,129 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:26:42,129 INFO  L87              Difference]: Start difference. First operand 2622 states and 3835 transitions. Second operand  has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:43,060 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:26:43,061 INFO  L93              Difference]: Finished difference Result 4218 states and 6209 transitions.
[2025-02-07 22:26:43,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-07 22:26:43,061 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 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 515
[2025-02-07 22:26:43,062 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:26:43,064 INFO  L225             Difference]: With dead ends: 4218
[2025-02-07 22:26:43,064 INFO  L226             Difference]: Without dead ends: 1629
[2025-02-07 22:26:43,066 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:26:43,068 INFO  L435           NwaCegarLoop]: 1107 mSDtfsCounter, 2157 mSDsluCounter, 3686 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 4793 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-07 22:26:43,068 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 4793 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-07 22:26:43,070 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1629 states.
[2025-02-07 22:26:43,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1628.
[2025-02-07 22:26:43,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1628 states, 1627 states have (on average 1.48740012292563) internal successors, (2420), 1627 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:43,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2420 transitions.
[2025-02-07 22:26:43,084 INFO  L78                 Accepts]: Start accepts. Automaton has 1628 states and 2420 transitions. Word has length 515
[2025-02-07 22:26:43,085 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:26:43,085 INFO  L471      AbstractCegarLoop]: Abstraction has 1628 states and 2420 transitions.
[2025-02-07 22:26:43,085 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:26:43,085 INFO  L276                IsEmpty]: Start isEmpty. Operand 1628 states and 2420 transitions.
[2025-02-07 22:26:43,087 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 517
[2025-02-07 22:26:43,087 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:26:43,088 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:26:43,088 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-07 22:26:43,088 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:26:43,088 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:26:43,089 INFO  L85        PathProgramCache]: Analyzing trace with hash 1692197077, now seen corresponding path program 1 times
[2025-02-07 22:26:43,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:26:43,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994635842]
[2025-02-07 22:26:43,089 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:26:43,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:26:43,164 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes.
[2025-02-07 22:26:45,405 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements.
[2025-02-07 22:26:45,405 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:26:45,405 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:26:46,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:26:46,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:26:46,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994635842]
[2025-02-07 22:26:46,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994635842] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:26:46,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:26:46,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-07 22:26:46,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905085535]
[2025-02-07 22:26:46,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:26:46,596 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 22:26:46,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:26:46,596 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 22:26:46,596 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:26:46,596 INFO  L87              Difference]: Start difference. First operand 1628 states and 2420 transitions. Second operand  has 8 states, 8 states have (on average 64.5) internal successors, (516), 7 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)