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


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


Checking for ERROR reachability
Using default analysis
Version 551b0097
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.sw_sym_ex.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 7efec3183b551b8159eccadb4807318ed392eb1a388f130f9498beabb74a52bc
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-09 08:07:51,141 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-09 08:07:51,208 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-01-09 08:07:51,218 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-09 08:07:51,219 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-09 08:07:51,238 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-09 08:07:51,239 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-09 08:07:51,239 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-09 08:07:51,239 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-01-09 08:07:51,239 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-01-09 08:07:51,239 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-01-09 08:07:51,239 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-01-09 08:07:51,240 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-09 08:07:51,240 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-09 08:07:51,240 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-09 08:07:51,240 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-09 08:07:51,240 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-01-09 08:07:51,240 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-09 08:07:51,241 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-09 08:07:51,241 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-01-09 08:07:51,241 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-01-09 08:07:51,241 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-01-09 08:07:51,241 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-09 08:07:51,241 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-09 08:07:51,241 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-09 08:07:51,241 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-01-09 08:07:51,241 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 08:07:51,242 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 08:07:51,242 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 08:07:51,242 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 08:07:51,242 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-09 08:07:51,242 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 08:07:51,242 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 08:07:51,242 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 08:07:51,242 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 08:07:51,242 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-09 08:07:51,242 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-01-09 08:07:51,242 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-01-09 08:07:51,243 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-01-09 08:07:51,243 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-09 08:07:51,243 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-01-09 08:07:51,243 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-01-09 08:07:51,243 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-01-09 08:07:51,243 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-01-09 08:07:51,243 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-01-09 08:07:51,244 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 -> 7efec3183b551b8159eccadb4807318ed392eb1a388f130f9498beabb74a52bc
[2025-01-09 08:07:51,528 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-09 08:07:51,537 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-09 08:07:51,540 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-09 08:07:51,542 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-09 08:07:51,542 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-09 08:07:51,544 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.sw_sym_ex.c
[2025-01-09 08:07:52,905 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/625e152dd/0fa0778a69414c38b8849ed1ed87cd9e/FLAGfbd76daeb
[2025-01-09 08:07:53,181 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-09 08:07:53,182 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex.c
[2025-01-09 08:07:53,194 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/625e152dd/0fa0778a69414c38b8849ed1ed87cd9e/FLAGfbd76daeb
[2025-01-09 08:07:53,466 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/625e152dd/0fa0778a69414c38b8849ed1ed87cd9e
[2025-01-09 08:07:53,469 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-09 08:07:53,470 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-09 08:07:53,471 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-09 08:07:53,471 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-09 08:07:53,475 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-09 08:07:53,475 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:53,476 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b7297b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53, skipping insertion in model container
[2025-01-09 08:07:53,476 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:53,515 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-09 08:07:53,648 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.sw_sym_ex.c[1249,1262]
[2025-01-09 08:07:53,808 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 08:07:53,818 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-09 08:07:53,828 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.sw_sym_ex.c[1249,1262]
[2025-01-09 08:07:53,928 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 08:07:53,943 INFO  L204         MainTranslator]: Completed translation
[2025-01-09 08:07:53,944 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53 WrapperNode
[2025-01-09 08:07:53,944 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-09 08:07:53,945 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-09 08:07:53,945 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-09 08:07:53,945 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-09 08:07:53,951 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:53,972 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,098 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1299
[2025-01-09 08:07:54,099 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-09 08:07:54,099 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-09 08:07:54,099 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-09 08:07:54,099 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-09 08:07:54,109 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,110 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,145 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,201 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-01-09 08:07:54,201 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,201 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,241 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,251 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,267 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,289 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,299 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,328 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-09 08:07:54,330 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-09 08:07:54,330 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-09 08:07:54,330 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-09 08:07:54,331 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (1/1) ...
[2025-01-09 08:07:54,338 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 08:07:54,351 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 08:07:54,366 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-01-09 08:07:54,369 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-01-09 08:07:54,393 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-09 08:07:54,394 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-09 08:07:54,394 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-09 08:07:54,394 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-09 08:07:54,609 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-09 08:07:54,611 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-09 08:07:56,244 INFO  L?                        ?]: Removed 798 outVars from TransFormulas that were not future-live.
[2025-01-09 08:07:56,244 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-09 08:07:56,268 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-09 08:07:56,268 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-01-09 08:07:56,269 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:07:56 BoogieIcfgContainer
[2025-01-09 08:07:56,269 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-09 08:07:56,271 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-01-09 08:07:56,271 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-01-09 08:07:56,275 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-01-09 08:07:56,275 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:07:53" (1/3) ...
[2025-01-09 08:07:56,276 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96fd14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:07:56, skipping insertion in model container
[2025-01-09 08:07:56,276 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:07:53" (2/3) ...
[2025-01-09 08:07:56,276 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96fd14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:07:56, skipping insertion in model container
[2025-01-09 08:07:56,276 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:07:56" (3/3) ...
[2025-01-09 08:07:56,277 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_sym_ex.c
[2025-01-09 08:07:56,291 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-01-09 08:07:56,293 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_sym_ex.c that has 1 procedures, 382 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-01-09 08:07:56,357 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-01-09 08:07:56,366 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;@1de055dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-01-09 08:07:56,366 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-01-09 08:07:56,371 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 382 states, 380 states have (on average 1.4973684210526317) internal successors, (569), 381 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:56,376 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-01-09 08:07:56,376 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:07:56,376 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 08:07:56,377 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:07:56,381 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:07:56,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -1356964072, now seen corresponding path program 1 times
[2025-01-09 08:07:56,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:07:56,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254657296]
[2025-01-09 08:07:56,388 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:07:56,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:07:56,478 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-01-09 08:07:56,545 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-01-09 08:07:56,546 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:07:56,546 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:07:57,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:07:57,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:07:57,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254657296]
[2025-01-09 08:07:57,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254657296] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:07:57,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:07:57,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 08:07:57,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660385287]
[2025-01-09 08:07:57,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:07:57,036 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 08:07:57,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:07:57,054 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 08:07:57,054 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 08:07:57,059 INFO  L87              Difference]: Start difference. First operand  has 382 states, 380 states have (on average 1.4973684210526317) internal successors, (569), 381 states have internal predecessors, (569), 0 states have call successors, (0), 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 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:57,151 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:07:57,151 INFO  L93              Difference]: Finished difference Result 717 states and 1071 transitions.
[2025-01-09 08:07:57,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 08:07:57,155 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2025-01-09 08:07:57,156 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:07:57,165 INFO  L225             Difference]: With dead ends: 717
[2025-01-09 08:07:57,166 INFO  L226             Difference]: Without dead ends: 381
[2025-01-09 08:07:57,169 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-01-09 08:07:57,172 INFO  L435           NwaCegarLoop]: 563 mSDtfsCounter, 0 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 08:07:57,173 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1683 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 08:07:57,185 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 381 states.
[2025-01-09 08:07:57,212 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381.
[2025-01-09 08:07:57,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 381 states, 380 states have (on average 1.4921052631578948) internal successors, (567), 380 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:57,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 567 transitions.
[2025-01-09 08:07:57,221 INFO  L78                 Accepts]: Start accepts. Automaton has 381 states and 567 transitions. Word has length 37
[2025-01-09 08:07:57,221 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:07:57,222 INFO  L471      AbstractCegarLoop]: Abstraction has 381 states and 567 transitions.
[2025-01-09 08:07:57,222 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:57,222 INFO  L276                IsEmpty]: Start isEmpty. Operand 381 states and 567 transitions.
[2025-01-09 08:07:57,223 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2025-01-09 08:07:57,224 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:07:57,224 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]
[2025-01-09 08:07:57,225 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-01-09 08:07:57,225 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:07:57,225 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:07:57,225 INFO  L85        PathProgramCache]: Analyzing trace with hash 885482089, now seen corresponding path program 1 times
[2025-01-09 08:07:57,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:07:57,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412229363]
[2025-01-09 08:07:57,226 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:07:57,226 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:07:57,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-01-09 08:07:57,270 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-01-09 08:07:57,270 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:07:57,270 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:07:57,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:07:57,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:07:57,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412229363]
[2025-01-09 08:07:57,448 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412229363] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:07:57,448 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:07:57,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 08:07:57,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199365719]
[2025-01-09 08:07:57,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:07:57,449 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 08:07:57,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:07:57,450 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 08:07:57,450 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 08:07:57,450 INFO  L87              Difference]: Start difference. First operand 381 states and 567 transitions. Second operand  has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:57,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:07:57,518 INFO  L93              Difference]: Finished difference Result 718 states and 1069 transitions.
[2025-01-09 08:07:57,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 08:07:57,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38
[2025-01-09 08:07:57,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:07:57,520 INFO  L225             Difference]: With dead ends: 718
[2025-01-09 08:07:57,523 INFO  L226             Difference]: Without dead ends: 383
[2025-01-09 08:07:57,524 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-01-09 08:07:57,525 INFO  L435           NwaCegarLoop]: 563 mSDtfsCounter, 0 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 08:07:57,525 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1679 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 08:07:57,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 383 states.
[2025-01-09 08:07:57,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383.
[2025-01-09 08:07:57,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 383 states, 382 states have (on average 1.4895287958115184) internal successors, (569), 382 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:57,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 569 transitions.
[2025-01-09 08:07:57,554 INFO  L78                 Accepts]: Start accepts. Automaton has 383 states and 569 transitions. Word has length 38
[2025-01-09 08:07:57,555 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:07:57,555 INFO  L471      AbstractCegarLoop]: Abstraction has 383 states and 569 transitions.
[2025-01-09 08:07:57,555 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:57,555 INFO  L276                IsEmpty]: Start isEmpty. Operand 383 states and 569 transitions.
[2025-01-09 08:07:57,556 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2025-01-09 08:07:57,556 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:07:57,556 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]
[2025-01-09 08:07:57,556 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-01-09 08:07:57,556 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:07:57,563 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:07:57,563 INFO  L85        PathProgramCache]: Analyzing trace with hash 582175249, now seen corresponding path program 1 times
[2025-01-09 08:07:57,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:07:57,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154600118]
[2025-01-09 08:07:57,564 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:07:57,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:07:57,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-01-09 08:07:57,618 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-01-09 08:07:57,620 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:07:57,620 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:07:57,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:07:57,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:07:57,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154600118]
[2025-01-09 08:07:57,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154600118] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:07:57,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:07:57,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:07:57,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211271680]
[2025-01-09 08:07:57,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:07:57,847 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:07:57,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:07:57,849 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:07:57,849 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:07:57,849 INFO  L87              Difference]: Start difference. First operand 383 states and 569 transitions. Second operand  has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:57,963 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:07:57,964 INFO  L93              Difference]: Finished difference Result 1027 states and 1528 transitions.
[2025-01-09 08:07:57,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:07:57,964 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39
[2025-01-09 08:07:57,965 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:07:57,968 INFO  L225             Difference]: With dead ends: 1027
[2025-01-09 08:07:57,969 INFO  L226             Difference]: Without dead ends: 690
[2025-01-09 08:07:57,970 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 08:07:57,971 INFO  L435           NwaCegarLoop]: 552 mSDtfsCounter, 1449 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:07:57,971 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 1650 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:07:57,973 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 690 states.
[2025-01-09 08:07:57,983 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 397.
[2025-01-09 08:07:57,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 397 states, 396 states have (on average 1.4873737373737375) internal successors, (589), 396 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:57,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 589 transitions.
[2025-01-09 08:07:57,985 INFO  L78                 Accepts]: Start accepts. Automaton has 397 states and 589 transitions. Word has length 39
[2025-01-09 08:07:57,985 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:07:57,986 INFO  L471      AbstractCegarLoop]: Abstraction has 397 states and 589 transitions.
[2025-01-09 08:07:57,986 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:57,986 INFO  L276                IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions.
[2025-01-09 08:07:57,994 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-01-09 08:07:57,994 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:07:57,995 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:07:57,995 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-01-09 08:07:57,995 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:07:57,996 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:07:57,996 INFO  L85        PathProgramCache]: Analyzing trace with hash -1451602872, now seen corresponding path program 1 times
[2025-01-09 08:07:57,996 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:07:57,996 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262723292]
[2025-01-09 08:07:57,997 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:07:57,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:07:58,086 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-01-09 08:07:58,760 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-01-09 08:07:58,760 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:07:58,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:07:59,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:07:59,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:07:59,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262723292]
[2025-01-09 08:07:59,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262723292] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:07:59,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:07:59,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:07:59,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803403967]
[2025-01-09 08:07:59,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:07:59,850 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:07:59,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:07:59,850 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:07:59,850 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:07:59,852 INFO  L87              Difference]: Start difference. First operand 397 states and 589 transitions. Second operand  has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:07:59,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:07:59,994 INFO  L93              Difference]: Finished difference Result 1003 states and 1491 transitions.
[2025-01-09 08:07:59,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:07:59,995 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206
[2025-01-09 08:07:59,995 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:07:59,999 INFO  L225             Difference]: With dead ends: 1003
[2025-01-09 08:08:00,000 INFO  L226             Difference]: Without dead ends: 666
[2025-01-09 08:08:00,000 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-01-09 08:08:00,002 INFO  L435           NwaCegarLoop]: 550 mSDtfsCounter, 1347 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:00,005 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 1647 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:00,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 666 states.
[2025-01-09 08:08:00,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 448.
[2025-01-09 08:08:00,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 448 states, 447 states have (on average 1.4809843400447427) internal successors, (662), 447 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:00,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 662 transitions.
[2025-01-09 08:08:00,032 INFO  L78                 Accepts]: Start accepts. Automaton has 448 states and 662 transitions. Word has length 206
[2025-01-09 08:08:00,032 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:00,032 INFO  L471      AbstractCegarLoop]: Abstraction has 448 states and 662 transitions.
[2025-01-09 08:08:00,032 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:00,032 INFO  L276                IsEmpty]: Start isEmpty. Operand 448 states and 662 transitions.
[2025-01-09 08:08:00,035 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2025-01-09 08:08:00,038 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:00,039 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:00,039 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-01-09 08:08:00,039 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:00,040 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:00,040 INFO  L85        PathProgramCache]: Analyzing trace with hash -736690901, now seen corresponding path program 1 times
[2025-01-09 08:08:00,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:00,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235533026]
[2025-01-09 08:08:00,040 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:00,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:00,122 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-01-09 08:08:00,871 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-01-09 08:08:00,872 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:00,872 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:01,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:01,931 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:01,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235533026]
[2025-01-09 08:08:01,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235533026] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:01,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:01,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:08:01,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709859405]
[2025-01-09 08:08:01,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:01,932 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:08:01,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:01,932 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:08:01,932 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:08:01,935 INFO  L87              Difference]: Start difference. First operand 448 states and 662 transitions. Second operand  has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:02,059 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:02,059 INFO  L93              Difference]: Finished difference Result 1003 states and 1489 transitions.
[2025-01-09 08:08:02,060 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:02,060 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 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 208
[2025-01-09 08:08:02,061 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:02,064 INFO  L225             Difference]: With dead ends: 1003
[2025-01-09 08:08:02,064 INFO  L226             Difference]: Without dead ends: 666
[2025-01-09 08:08:02,065 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-01-09 08:08:02,067 INFO  L435           NwaCegarLoop]: 549 mSDtfsCounter, 1281 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:02,067 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1646 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:02,070 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 666 states.
[2025-01-09 08:08:02,089 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 571.
[2025-01-09 08:08:02,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 571 states, 570 states have (on average 1.4824561403508771) internal successors, (845), 570 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:02,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 845 transitions.
[2025-01-09 08:08:02,093 INFO  L78                 Accepts]: Start accepts. Automaton has 571 states and 845 transitions. Word has length 208
[2025-01-09 08:08:02,093 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:02,093 INFO  L471      AbstractCegarLoop]: Abstraction has 571 states and 845 transitions.
[2025-01-09 08:08:02,093 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:02,093 INFO  L276                IsEmpty]: Start isEmpty. Operand 571 states and 845 transitions.
[2025-01-09 08:08:02,095 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2025-01-09 08:08:02,095 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:02,095 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:02,095 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-01-09 08:08:02,095 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:02,096 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:02,096 INFO  L85        PathProgramCache]: Analyzing trace with hash -2057904229, now seen corresponding path program 1 times
[2025-01-09 08:08:02,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:02,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015132704]
[2025-01-09 08:08:02,096 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:02,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:02,156 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-01-09 08:08:02,835 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-01-09 08:08:02,835 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:02,835 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:03,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:03,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:03,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015132704]
[2025-01-09 08:08:03,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015132704] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:03,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:03,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 08:08:03,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698877923]
[2025-01-09 08:08:03,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:03,879 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 08:08:03,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:03,883 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 08:08:03,883 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:03,884 INFO  L87              Difference]: Start difference. First operand 571 states and 845 transitions. Second operand  has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:04,062 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:04,062 INFO  L93              Difference]: Finished difference Result 1011 states and 1500 transitions.
[2025-01-09 08:08:04,063 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 08:08:04,063 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 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 209
[2025-01-09 08:08:04,064 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:04,069 INFO  L225             Difference]: With dead ends: 1011
[2025-01-09 08:08:04,069 INFO  L226             Difference]: Without dead ends: 674
[2025-01-09 08:08:04,071 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:04,072 INFO  L435           NwaCegarLoop]: 546 mSDtfsCounter, 1301 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:04,072 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 2451 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:04,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 674 states.
[2025-01-09 08:08:04,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 574.
[2025-01-09 08:08:04,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 574 states, 573 states have (on average 1.4816753926701571) internal successors, (849), 573 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:04,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 849 transitions.
[2025-01-09 08:08:04,102 INFO  L78                 Accepts]: Start accepts. Automaton has 574 states and 849 transitions. Word has length 209
[2025-01-09 08:08:04,103 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:04,103 INFO  L471      AbstractCegarLoop]: Abstraction has 574 states and 849 transitions.
[2025-01-09 08:08:04,103 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:04,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 574 states and 849 transitions.
[2025-01-09 08:08:04,106 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-01-09 08:08:04,107 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:04,107 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:04,107 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-01-09 08:08:04,108 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:04,108 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:04,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -1244200430, now seen corresponding path program 1 times
[2025-01-09 08:08:04,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:04,109 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877594167]
[2025-01-09 08:08:04,109 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:04,109 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:04,186 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-01-09 08:08:04,497 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-01-09 08:08:04,497 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:04,497 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:05,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:05,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:05,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877594167]
[2025-01-09 08:08:05,227 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877594167] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:05,227 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:05,227 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:08:05,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731786306]
[2025-01-09 08:08:05,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:05,228 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:08:05,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:05,228 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:08:05,228 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:08:05,229 INFO  L87              Difference]: Start difference. First operand 574 states and 849 transitions. Second operand  has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:05,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:05,347 INFO  L93              Difference]: Finished difference Result 1070 states and 1586 transitions.
[2025-01-09 08:08:05,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:05,348 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 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 210
[2025-01-09 08:08:05,348 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:05,351 INFO  L225             Difference]: With dead ends: 1070
[2025-01-09 08:08:05,351 INFO  L226             Difference]: Without dead ends: 668
[2025-01-09 08:08:05,352 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-01-09 08:08:05,355 INFO  L435           NwaCegarLoop]: 549 mSDtfsCounter, 1311 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:05,355 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1646 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:05,356 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 668 states.
[2025-01-09 08:08:05,368 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 574.
[2025-01-09 08:08:05,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 574 states, 573 states have (on average 1.4799301919720769) internal successors, (848), 573 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:05,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 848 transitions.
[2025-01-09 08:08:05,371 INFO  L78                 Accepts]: Start accepts. Automaton has 574 states and 848 transitions. Word has length 210
[2025-01-09 08:08:05,372 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:05,372 INFO  L471      AbstractCegarLoop]: Abstraction has 574 states and 848 transitions.
[2025-01-09 08:08:05,372 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:05,372 INFO  L276                IsEmpty]: Start isEmpty. Operand 574 states and 848 transitions.
[2025-01-09 08:08:05,376 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-01-09 08:08:05,377 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:05,377 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:05,377 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-01-09 08:08:05,377 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:05,378 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:05,378 INFO  L85        PathProgramCache]: Analyzing trace with hash 746144786, now seen corresponding path program 1 times
[2025-01-09 08:08:05,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:05,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647203853]
[2025-01-09 08:08:05,379 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:05,379 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:05,450 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-01-09 08:08:05,852 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-01-09 08:08:05,853 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:05,853 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:06,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:06,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:06,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647203853]
[2025-01-09 08:08:06,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647203853] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:06,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:06,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:08:06,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31682588]
[2025-01-09 08:08:06,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:06,600 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:08:06,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:06,601 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:08:06,601 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:08:06,601 INFO  L87              Difference]: Start difference. First operand 574 states and 848 transitions. Second operand  has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:06,725 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:06,725 INFO  L93              Difference]: Finished difference Result 1038 states and 1537 transitions.
[2025-01-09 08:08:06,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:06,726 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211
[2025-01-09 08:08:06,726 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:06,729 INFO  L225             Difference]: With dead ends: 1038
[2025-01-09 08:08:06,729 INFO  L226             Difference]: Without dead ends: 668
[2025-01-09 08:08:06,730 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:08:06,730 INFO  L435           NwaCegarLoop]: 549 mSDtfsCounter, 1292 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:06,730 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 1646 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:06,731 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 668 states.
[2025-01-09 08:08:06,741 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 574.
[2025-01-09 08:08:06,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 574 states, 573 states have (on average 1.4781849912739966) internal successors, (847), 573 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:06,744 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 847 transitions.
[2025-01-09 08:08:06,745 INFO  L78                 Accepts]: Start accepts. Automaton has 574 states and 847 transitions. Word has length 211
[2025-01-09 08:08:06,745 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:06,745 INFO  L471      AbstractCegarLoop]: Abstraction has 574 states and 847 transitions.
[2025-01-09 08:08:06,745 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:06,745 INFO  L276                IsEmpty]: Start isEmpty. Operand 574 states and 847 transitions.
[2025-01-09 08:08:06,747 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-01-09 08:08:06,747 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:06,748 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:06,748 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-01-09 08:08:06,748 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:06,748 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:06,748 INFO  L85        PathProgramCache]: Analyzing trace with hash -451875766, now seen corresponding path program 1 times
[2025-01-09 08:08:06,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:06,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244930263]
[2025-01-09 08:08:06,749 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:06,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:06,812 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-01-09 08:08:07,173 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-01-09 08:08:07,173 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:07,173 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:07,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:07,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:07,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244930263]
[2025-01-09 08:08:07,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244930263] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:07,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:07,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 08:08:07,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830467685]
[2025-01-09 08:08:07,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:07,844 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 08:08:07,845 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:07,845 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 08:08:07,845 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:07,846 INFO  L87              Difference]: Start difference. First operand 574 states and 847 transitions. Second operand  has 7 states, 7 states have (on average 30.285714285714285) internal successors, (212), 7 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:08,007 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:08,008 INFO  L93              Difference]: Finished difference Result 1042 states and 1542 transitions.
[2025-01-09 08:08:08,008 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 08:08:08,008 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 30.285714285714285) internal successors, (212), 7 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212
[2025-01-09 08:08:08,009 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:08,011 INFO  L225             Difference]: With dead ends: 1042
[2025-01-09 08:08:08,011 INFO  L226             Difference]: Without dead ends: 676
[2025-01-09 08:08:08,012 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:08,013 INFO  L435           NwaCegarLoop]: 546 mSDtfsCounter, 1312 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:08,013 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 2586 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:08,014 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 676 states.
[2025-01-09 08:08:08,025 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 576.
[2025-01-09 08:08:08,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 576 states, 575 states have (on average 1.4765217391304348) internal successors, (849), 575 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:08,029 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 849 transitions.
[2025-01-09 08:08:08,029 INFO  L78                 Accepts]: Start accepts. Automaton has 576 states and 849 transitions. Word has length 212
[2025-01-09 08:08:08,030 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:08,030 INFO  L471      AbstractCegarLoop]: Abstraction has 576 states and 849 transitions.
[2025-01-09 08:08:08,031 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 30.285714285714285) internal successors, (212), 7 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:08,031 INFO  L276                IsEmpty]: Start isEmpty. Operand 576 states and 849 transitions.
[2025-01-09 08:08:08,033 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-01-09 08:08:08,033 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:08,033 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:08,034 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-01-09 08:08:08,034 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:08,035 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:08,035 INFO  L85        PathProgramCache]: Analyzing trace with hash -458312135, now seen corresponding path program 1 times
[2025-01-09 08:08:08,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:08,035 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421275802]
[2025-01-09 08:08:08,035 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:08,035 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:08,108 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-01-09 08:08:08,596 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-01-09 08:08:08,597 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:08,597 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:09,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:09,266 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:09,266 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421275802]
[2025-01-09 08:08:09,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421275802] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:09,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:09,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:08:09,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765516954]
[2025-01-09 08:08:09,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:09,267 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:08:09,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:09,268 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:08:09,268 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:08:09,268 INFO  L87              Difference]: Start difference. First operand 576 states and 849 transitions. Second operand  has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:09,380 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:09,381 INFO  L93              Difference]: Finished difference Result 1010 states and 1495 transitions.
[2025-01-09 08:08:09,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:09,381 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 0 states have call successors, (0), 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 213
[2025-01-09 08:08:09,382 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:09,384 INFO  L225             Difference]: With dead ends: 1010
[2025-01-09 08:08:09,385 INFO  L226             Difference]: Without dead ends: 673
[2025-01-09 08:08:09,385 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:09,386 INFO  L435           NwaCegarLoop]: 549 mSDtfsCounter, 1228 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:09,386 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1642 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:09,387 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 673 states.
[2025-01-09 08:08:09,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 671.
[2025-01-09 08:08:09,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 671 states, 670 states have (on average 1.4776119402985075) internal successors, (990), 670 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:09,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 990 transitions.
[2025-01-09 08:08:09,402 INFO  L78                 Accepts]: Start accepts. Automaton has 671 states and 990 transitions. Word has length 213
[2025-01-09 08:08:09,402 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:09,403 INFO  L471      AbstractCegarLoop]: Abstraction has 671 states and 990 transitions.
[2025-01-09 08:08:09,403 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:09,403 INFO  L276                IsEmpty]: Start isEmpty. Operand 671 states and 990 transitions.
[2025-01-09 08:08:09,405 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-01-09 08:08:09,405 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:09,405 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:09,406 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-01-09 08:08:09,406 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:09,406 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:09,406 INFO  L85        PathProgramCache]: Analyzing trace with hash 1340981493, now seen corresponding path program 1 times
[2025-01-09 08:08:09,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:09,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116913922]
[2025-01-09 08:08:09,407 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:09,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:09,472 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-01-09 08:08:09,873 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-01-09 08:08:09,874 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:09,874 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:10,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:10,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:10,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116913922]
[2025-01-09 08:08:10,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116913922] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:10,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:10,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:08:10,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359995017]
[2025-01-09 08:08:10,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:10,448 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:08:10,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:10,448 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:08:10,449 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:08:10,449 INFO  L87              Difference]: Start difference. First operand 671 states and 990 transitions. Second operand  has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:10,554 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:10,554 INFO  L93              Difference]: Finished difference Result 1038 states and 1535 transitions.
[2025-01-09 08:08:10,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:10,555 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 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 214
[2025-01-09 08:08:10,555 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:10,558 INFO  L225             Difference]: With dead ends: 1038
[2025-01-09 08:08:10,558 INFO  L226             Difference]: Without dead ends: 671
[2025-01-09 08:08:10,559 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-01-09 08:08:10,559 INFO  L435           NwaCegarLoop]: 549 mSDtfsCounter, 1238 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:10,560 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1646 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:10,561 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 671 states.
[2025-01-09 08:08:10,571 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671.
[2025-01-09 08:08:10,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 671 states, 670 states have (on average 1.4761194029850746) internal successors, (989), 670 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:10,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 989 transitions.
[2025-01-09 08:08:10,575 INFO  L78                 Accepts]: Start accepts. Automaton has 671 states and 989 transitions. Word has length 214
[2025-01-09 08:08:10,575 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:10,575 INFO  L471      AbstractCegarLoop]: Abstraction has 671 states and 989 transitions.
[2025-01-09 08:08:10,576 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:10,576 INFO  L276                IsEmpty]: Start isEmpty. Operand 671 states and 989 transitions.
[2025-01-09 08:08:10,578 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-01-09 08:08:10,578 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:10,578 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:10,578 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-01-09 08:08:10,579 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:10,579 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:10,579 INFO  L85        PathProgramCache]: Analyzing trace with hash 1210162929, now seen corresponding path program 1 times
[2025-01-09 08:08:10,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:10,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855639409]
[2025-01-09 08:08:10,580 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:10,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:10,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-01-09 08:08:11,098 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-01-09 08:08:11,099 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:11,099 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:11,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:11,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:11,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855639409]
[2025-01-09 08:08:11,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855639409] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:11,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:11,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 08:08:11,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795789955]
[2025-01-09 08:08:11,717 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:11,718 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 08:08:11,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:11,718 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 08:08:11,719 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:11,719 INFO  L87              Difference]: Start difference. First operand 671 states and 989 transitions. Second operand  has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:11,874 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:11,875 INFO  L93              Difference]: Finished difference Result 1041 states and 1538 transitions.
[2025-01-09 08:08:11,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 08:08:11,875 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215
[2025-01-09 08:08:11,876 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:11,879 INFO  L225             Difference]: With dead ends: 1041
[2025-01-09 08:08:11,879 INFO  L226             Difference]: Without dead ends: 678
[2025-01-09 08:08:11,880 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:11,880 INFO  L435           NwaCegarLoop]: 546 mSDtfsCounter, 1256 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:11,881 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 2443 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:11,882 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 678 states.
[2025-01-09 08:08:11,896 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 673.
[2025-01-09 08:08:11,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 673 states, 672 states have (on average 1.474702380952381) internal successors, (991), 672 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:11,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 991 transitions.
[2025-01-09 08:08:11,900 INFO  L78                 Accepts]: Start accepts. Automaton has 673 states and 991 transitions. Word has length 215
[2025-01-09 08:08:11,901 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:11,901 INFO  L471      AbstractCegarLoop]: Abstraction has 673 states and 991 transitions.
[2025-01-09 08:08:11,901 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:11,901 INFO  L276                IsEmpty]: Start isEmpty. Operand 673 states and 991 transitions.
[2025-01-09 08:08:11,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-01-09 08:08:11,905 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:11,905 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:11,905 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-01-09 08:08:11,905 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:11,906 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:11,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 766167662, now seen corresponding path program 1 times
[2025-01-09 08:08:11,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:11,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126544543]
[2025-01-09 08:08:11,907 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:11,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:11,992 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-01-09 08:08:12,404 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-01-09 08:08:12,404 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:12,404 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:13,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:13,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:13,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126544543]
[2025-01-09 08:08:13,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126544543] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:13,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:13,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 08:08:13,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978431911]
[2025-01-09 08:08:13,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:13,013 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 08:08:13,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:13,014 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 08:08:13,015 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:13,015 INFO  L87              Difference]: Start difference. First operand 673 states and 991 transitions. Second operand  has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:13,181 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:13,182 INFO  L93              Difference]: Finished difference Result 1145 states and 1691 transitions.
[2025-01-09 08:08:13,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 08:08:13,183 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 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 216
[2025-01-09 08:08:13,183 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:13,186 INFO  L225             Difference]: With dead ends: 1145
[2025-01-09 08:08:13,187 INFO  L226             Difference]: Without dead ends: 720
[2025-01-09 08:08:13,188 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:13,188 INFO  L435           NwaCegarLoop]: 545 mSDtfsCounter, 1406 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:13,189 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 2724 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:13,191 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 720 states.
[2025-01-09 08:08:13,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 675.
[2025-01-09 08:08:13,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 675 states, 674 states have (on average 1.4732937685459941) internal successors, (993), 674 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:13,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 993 transitions.
[2025-01-09 08:08:13,207 INFO  L78                 Accepts]: Start accepts. Automaton has 675 states and 993 transitions. Word has length 216
[2025-01-09 08:08:13,207 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:13,207 INFO  L471      AbstractCegarLoop]: Abstraction has 675 states and 993 transitions.
[2025-01-09 08:08:13,208 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:13,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 675 states and 993 transitions.
[2025-01-09 08:08:13,210 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-01-09 08:08:13,210 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:13,210 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:13,211 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-01-09 08:08:13,211 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:13,212 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:13,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -1237679278, now seen corresponding path program 1 times
[2025-01-09 08:08:13,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:13,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134946602]
[2025-01-09 08:08:13,212 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:13,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:13,274 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-01-09 08:08:13,667 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-01-09 08:08:13,668 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:13,668 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:14,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:14,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:14,232 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134946602]
[2025-01-09 08:08:14,232 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134946602] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:14,232 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:14,232 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:08:14,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113097238]
[2025-01-09 08:08:14,232 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:14,233 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:08:14,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:14,233 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:08:14,233 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:08:14,234 INFO  L87              Difference]: Start difference. First operand 675 states and 993 transitions. Second operand  has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:14,331 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:14,331 INFO  L93              Difference]: Finished difference Result 1076 states and 1587 transitions.
[2025-01-09 08:08:14,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:14,332 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 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 216
[2025-01-09 08:08:14,332 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:14,335 INFO  L225             Difference]: With dead ends: 1076
[2025-01-09 08:08:14,335 INFO  L226             Difference]: Without dead ends: 675
[2025-01-09 08:08:14,336 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-01-09 08:08:14,336 INFO  L435           NwaCegarLoop]: 549 mSDtfsCounter, 1252 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:14,336 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 1646 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:14,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 675 states.
[2025-01-09 08:08:14,351 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675.
[2025-01-09 08:08:14,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 675 states, 674 states have (on average 1.4718100890207715) internal successors, (992), 674 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:14,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 992 transitions.
[2025-01-09 08:08:14,354 INFO  L78                 Accepts]: Start accepts. Automaton has 675 states and 992 transitions. Word has length 216
[2025-01-09 08:08:14,355 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:14,355 INFO  L471      AbstractCegarLoop]: Abstraction has 675 states and 992 transitions.
[2025-01-09 08:08:14,355 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:14,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 675 states and 992 transitions.
[2025-01-09 08:08:14,357 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 218
[2025-01-09 08:08:14,357 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:14,357 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:14,358 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-01-09 08:08:14,358 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:14,358 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:14,358 INFO  L85        PathProgramCache]: Analyzing trace with hash -1984221122, now seen corresponding path program 1 times
[2025-01-09 08:08:14,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:14,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730196866]
[2025-01-09 08:08:14,359 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:14,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:14,415 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes.
[2025-01-09 08:08:14,784 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements.
[2025-01-09 08:08:14,785 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:14,785 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:15,410 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:15,410 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:15,411 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730196866]
[2025-01-09 08:08:15,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730196866] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:15,411 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:15,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 08:08:15,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974158064]
[2025-01-09 08:08:15,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:15,411 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 08:08:15,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:15,412 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 08:08:15,412 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:15,413 INFO  L87              Difference]: Start difference. First operand 675 states and 992 transitions. Second operand  has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:15,554 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:15,555 INFO  L93              Difference]: Finished difference Result 1019 states and 1503 transitions.
[2025-01-09 08:08:15,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 08:08:15,555 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217
[2025-01-09 08:08:15,556 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:15,558 INFO  L225             Difference]: With dead ends: 1019
[2025-01-09 08:08:15,559 INFO  L226             Difference]: Without dead ends: 682
[2025-01-09 08:08:15,559 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:15,560 INFO  L435           NwaCegarLoop]: 546 mSDtfsCounter, 1229 mSDsluCounter, 2175 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:15,560 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 2721 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:15,561 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 682 states.
[2025-01-09 08:08:15,570 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 678.
[2025-01-09 08:08:15,571 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 678 states, 677 states have (on average 1.4711964549483014) internal successors, (996), 677 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:15,574 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 996 transitions.
[2025-01-09 08:08:15,574 INFO  L78                 Accepts]: Start accepts. Automaton has 678 states and 996 transitions. Word has length 217
[2025-01-09 08:08:15,574 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:15,574 INFO  L471      AbstractCegarLoop]: Abstraction has 678 states and 996 transitions.
[2025-01-09 08:08:15,574 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:15,575 INFO  L276                IsEmpty]: Start isEmpty. Operand 678 states and 996 transitions.
[2025-01-09 08:08:15,577 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2025-01-09 08:08:15,577 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:15,577 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:15,577 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-01-09 08:08:15,577 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:15,578 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:15,578 INFO  L85        PathProgramCache]: Analyzing trace with hash 864700535, now seen corresponding path program 1 times
[2025-01-09 08:08:15,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:15,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831442565]
[2025-01-09 08:08:15,578 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:15,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:15,637 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-01-09 08:08:15,991 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-01-09 08:08:15,992 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:15,992 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:16,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:16,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:16,577 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831442565]
[2025-01-09 08:08:16,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831442565] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:16,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:16,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 08:08:16,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578084214]
[2025-01-09 08:08:16,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:16,579 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 08:08:16,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:16,580 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 08:08:16,580 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:16,580 INFO  L87              Difference]: Start difference. First operand 678 states and 996 transitions. Second operand  has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:16,715 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:16,715 INFO  L93              Difference]: Finished difference Result 1084 states and 1596 transitions.
[2025-01-09 08:08:16,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 08:08:16,716 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218
[2025-01-09 08:08:16,716 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:16,719 INFO  L225             Difference]: With dead ends: 1084
[2025-01-09 08:08:16,719 INFO  L226             Difference]: Without dead ends: 684
[2025-01-09 08:08:16,719 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:16,720 INFO  L435           NwaCegarLoop]: 546 mSDtfsCounter, 1270 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:16,720 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 2441 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:16,721 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 684 states.
[2025-01-09 08:08:16,732 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 680.
[2025-01-09 08:08:16,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 680 states, 679 states have (on average 1.4698085419734905) internal successors, (998), 679 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:16,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 998 transitions.
[2025-01-09 08:08:16,736 INFO  L78                 Accepts]: Start accepts. Automaton has 680 states and 998 transitions. Word has length 218
[2025-01-09 08:08:16,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:16,736 INFO  L471      AbstractCegarLoop]: Abstraction has 680 states and 998 transitions.
[2025-01-09 08:08:16,737 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:16,737 INFO  L276                IsEmpty]: Start isEmpty. Operand 680 states and 998 transitions.
[2025-01-09 08:08:16,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 220
[2025-01-09 08:08:16,739 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:16,739 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:16,739 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-01-09 08:08:16,740 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:16,741 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:16,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -750976054, now seen corresponding path program 1 times
[2025-01-09 08:08:16,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:16,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734043015]
[2025-01-09 08:08:16,741 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:16,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:16,797 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes.
[2025-01-09 08:08:17,113 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements.
[2025-01-09 08:08:17,113 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:17,113 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:17,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:17,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:17,560 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734043015]
[2025-01-09 08:08:17,560 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734043015] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:17,560 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:17,560 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 08:08:17,560 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036582568]
[2025-01-09 08:08:17,560 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:17,561 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 08:08:17,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:17,561 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 08:08:17,561 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:17,562 INFO  L87              Difference]: Start difference. First operand 680 states and 998 transitions. Second operand  has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:17,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:17,705 INFO  L93              Difference]: Finished difference Result 1122 states and 1652 transitions.
[2025-01-09 08:08:17,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 08:08:17,706 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 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 219
[2025-01-09 08:08:17,706 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:17,709 INFO  L225             Difference]: With dead ends: 1122
[2025-01-09 08:08:17,709 INFO  L226             Difference]: Without dead ends: 726
[2025-01-09 08:08:17,710 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:17,710 INFO  L435           NwaCegarLoop]: 545 mSDtfsCounter, 1387 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:17,710 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 2556 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:17,711 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 726 states.
[2025-01-09 08:08:17,720 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 682.
[2025-01-09 08:08:17,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 682 states, 681 states have (on average 1.4684287812041117) internal successors, (1000), 681 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:17,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1000 transitions.
[2025-01-09 08:08:17,724 INFO  L78                 Accepts]: Start accepts. Automaton has 682 states and 1000 transitions. Word has length 219
[2025-01-09 08:08:17,724 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:17,724 INFO  L471      AbstractCegarLoop]: Abstraction has 682 states and 1000 transitions.
[2025-01-09 08:08:17,725 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:17,725 INFO  L276                IsEmpty]: Start isEmpty. Operand 682 states and 1000 transitions.
[2025-01-09 08:08:17,727 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 220
[2025-01-09 08:08:17,727 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:17,727 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:17,727 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-01-09 08:08:17,728 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:17,728 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:17,728 INFO  L85        PathProgramCache]: Analyzing trace with hash 2125930342, now seen corresponding path program 1 times
[2025-01-09 08:08:17,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:17,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789207851]
[2025-01-09 08:08:17,729 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:17,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:17,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes.
[2025-01-09 08:08:18,102 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements.
[2025-01-09 08:08:18,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:18,102 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:18,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:18,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:18,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789207851]
[2025-01-09 08:08:18,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789207851] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:18,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:18,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 08:08:18,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600506874]
[2025-01-09 08:08:18,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:18,561 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 08:08:18,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:18,562 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 08:08:18,562 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:18,562 INFO  L87              Difference]: Start difference. First operand 682 states and 1000 transitions. Second operand  has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:18,763 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:18,763 INFO  L93              Difference]: Finished difference Result 1090 states and 1605 transitions.
[2025-01-09 08:08:18,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 08:08:18,763 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 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 219
[2025-01-09 08:08:18,764 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:18,766 INFO  L225             Difference]: With dead ends: 1090
[2025-01-09 08:08:18,766 INFO  L226             Difference]: Without dead ends: 728
[2025-01-09 08:08:18,767 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:18,767 INFO  L435           NwaCegarLoop]: 545 mSDtfsCounter, 1369 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:18,768 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 2556 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:18,768 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 728 states.
[2025-01-09 08:08:18,778 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 684.
[2025-01-09 08:08:18,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 684 states, 683 states have (on average 1.4670571010248903) internal successors, (1002), 683 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:18,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1002 transitions.
[2025-01-09 08:08:18,782 INFO  L78                 Accepts]: Start accepts. Automaton has 684 states and 1002 transitions. Word has length 219
[2025-01-09 08:08:18,782 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:18,782 INFO  L471      AbstractCegarLoop]: Abstraction has 684 states and 1002 transitions.
[2025-01-09 08:08:18,782 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:18,782 INFO  L276                IsEmpty]: Start isEmpty. Operand 684 states and 1002 transitions.
[2025-01-09 08:08:18,785 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 220
[2025-01-09 08:08:18,785 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:18,785 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:18,785 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-01-09 08:08:18,785 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:18,786 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:18,786 INFO  L85        PathProgramCache]: Analyzing trace with hash -372495870, now seen corresponding path program 1 times
[2025-01-09 08:08:18,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:18,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278944327]
[2025-01-09 08:08:18,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:18,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:18,851 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes.
[2025-01-09 08:08:19,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements.
[2025-01-09 08:08:19,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:19,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:19,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:19,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:19,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278944327]
[2025-01-09 08:08:19,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278944327] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:19,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:19,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 08:08:19,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120173494]
[2025-01-09 08:08:19,717 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:19,717 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 08:08:19,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:19,718 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 08:08:19,718 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-01-09 08:08:19,718 INFO  L87              Difference]: Start difference. First operand 684 states and 1002 transitions. Second operand  has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:19,851 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:19,851 INFO  L93              Difference]: Finished difference Result 1067 states and 1571 transitions.
[2025-01-09 08:08:19,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-01-09 08:08:19,852 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 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 219
[2025-01-09 08:08:19,852 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:19,855 INFO  L225             Difference]: With dead ends: 1067
[2025-01-09 08:08:19,855 INFO  L226             Difference]: Without dead ends: 730
[2025-01-09 08:08:19,856 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:19,856 INFO  L435           NwaCegarLoop]: 545 mSDtfsCounter, 1350 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:19,856 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2640 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:19,857 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 730 states.
[2025-01-09 08:08:19,867 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 690.
[2025-01-09 08:08:19,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 690 states, 689 states have (on average 1.4658925979680697) internal successors, (1010), 689 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:19,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1010 transitions.
[2025-01-09 08:08:19,870 INFO  L78                 Accepts]: Start accepts. Automaton has 690 states and 1010 transitions. Word has length 219
[2025-01-09 08:08:19,870 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:19,870 INFO  L471      AbstractCegarLoop]: Abstraction has 690 states and 1010 transitions.
[2025-01-09 08:08:19,871 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:19,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 690 states and 1010 transitions.
[2025-01-09 08:08:19,873 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 220
[2025-01-09 08:08:19,873 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:19,874 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:19,874 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-01-09 08:08:19,874 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:19,874 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:19,874 INFO  L85        PathProgramCache]: Analyzing trace with hash 1034544030, now seen corresponding path program 1 times
[2025-01-09 08:08:19,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:19,874 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587632445]
[2025-01-09 08:08:19,874 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:19,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:19,925 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes.
[2025-01-09 08:08:20,280 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements.
[2025-01-09 08:08:20,280 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:20,280 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:20,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:20,662 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:20,662 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587632445]
[2025-01-09 08:08:20,662 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587632445] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-09 08:08:20,662 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475737032]
[2025-01-09 08:08:20,663 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:20,663 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 08:08:20,663 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 08:08:20,666 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-09 08:08:20,668 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-01-09 08:08:21,145 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes.
[2025-01-09 08:08:21,342 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements.
[2025-01-09 08:08:21,342 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:21,342 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:21,352 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-01-09 08:08:21,369 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-09 08:08:21,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:21,616 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-01-09 08:08:21,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [475737032] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:21,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-01-09 08:08:21,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9
[2025-01-09 08:08:21,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843756538]
[2025-01-09 08:08:21,617 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:21,617 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:08:21,617 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:21,618 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:08:21,618 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-01-09 08:08:21,619 INFO  L87              Difference]: Start difference. First operand 690 states and 1010 transitions. Second operand  has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:21,852 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:21,852 INFO  L93              Difference]: Finished difference Result 1300 states and 1904 transitions.
[2025-01-09 08:08:21,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:21,853 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 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 219
[2025-01-09 08:08:21,853 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:21,855 INFO  L225             Difference]: With dead ends: 1300
[2025-01-09 08:08:21,855 INFO  L226             Difference]: Without dead ends: 689
[2025-01-09 08:08:21,856 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-01-09 08:08:21,860 INFO  L435           NwaCegarLoop]: 480 mSDtfsCounter, 1346 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:21,860 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 1436 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-01-09 08:08:21,861 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 689 states.
[2025-01-09 08:08:21,873 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689.
[2025-01-09 08:08:21,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 689 states, 688 states have (on average 1.4636627906976745) internal successors, (1007), 688 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:21,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1007 transitions.
[2025-01-09 08:08:21,876 INFO  L78                 Accepts]: Start accepts. Automaton has 689 states and 1007 transitions. Word has length 219
[2025-01-09 08:08:21,876 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:21,876 INFO  L471      AbstractCegarLoop]: Abstraction has 689 states and 1007 transitions.
[2025-01-09 08:08:21,877 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:21,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 689 states and 1007 transitions.
[2025-01-09 08:08:21,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 221
[2025-01-09 08:08:21,878 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:21,878 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:21,891 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-01-09 08:08:22,079 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 08:08:22,081 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:22,081 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:22,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -702625767, now seen corresponding path program 1 times
[2025-01-09 08:08:22,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:22,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637392807]
[2025-01-09 08:08:22,082 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:22,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:22,136 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes.
[2025-01-09 08:08:22,500 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements.
[2025-01-09 08:08:22,500 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:22,500 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:22,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:22,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:22,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637392807]
[2025-01-09 08:08:22,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637392807] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:22,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:22,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:08:22,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188289305]
[2025-01-09 08:08:22,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:22,851 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:08:22,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:22,851 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:08:22,851 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:08:22,852 INFO  L87              Difference]: Start difference. First operand 689 states and 1007 transitions. Second operand  has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:22,940 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:22,940 INFO  L93              Difference]: Finished difference Result 1207 states and 1766 transitions.
[2025-01-09 08:08:22,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:22,941 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 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 220
[2025-01-09 08:08:22,941 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:22,943 INFO  L225             Difference]: With dead ends: 1207
[2025-01-09 08:08:22,943 INFO  L226             Difference]: Without dead ends: 689
[2025-01-09 08:08:22,944 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-01-09 08:08:22,945 INFO  L435           NwaCegarLoop]: 550 mSDtfsCounter, 1295 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:22,945 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1647 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:22,946 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 689 states.
[2025-01-09 08:08:22,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689.
[2025-01-09 08:08:22,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 689 states, 688 states have (on average 1.4622093023255813) internal successors, (1006), 688 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:22,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1006 transitions.
[2025-01-09 08:08:22,958 INFO  L78                 Accepts]: Start accepts. Automaton has 689 states and 1006 transitions. Word has length 220
[2025-01-09 08:08:22,958 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:22,958 INFO  L471      AbstractCegarLoop]: Abstraction has 689 states and 1006 transitions.
[2025-01-09 08:08:22,958 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:22,958 INFO  L276                IsEmpty]: Start isEmpty. Operand 689 states and 1006 transitions.
[2025-01-09 08:08:22,959 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-01-09 08:08:22,959 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:22,960 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:22,960 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-01-09 08:08:22,960 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:22,960 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:22,960 INFO  L85        PathProgramCache]: Analyzing trace with hash -608140986, now seen corresponding path program 1 times
[2025-01-09 08:08:22,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:22,961 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735942771]
[2025-01-09 08:08:22,961 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:22,961 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:23,011 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-01-09 08:08:23,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-01-09 08:08:23,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:23,496 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:23,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:23,976 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:23,977 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735942771]
[2025-01-09 08:08:23,977 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735942771] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:23,977 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:23,977 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-09 08:08:23,977 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864690014]
[2025-01-09 08:08:23,977 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:23,977 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 08:08:23,977 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:23,978 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 08:08:23,978 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-01-09 08:08:23,978 INFO  L87              Difference]: Start difference. First operand 689 states and 1006 transitions. Second operand  has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:24,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:24,084 INFO  L93              Difference]: Finished difference Result 1171 states and 1713 transitions.
[2025-01-09 08:08:24,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:24,085 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 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 221
[2025-01-09 08:08:24,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:24,088 INFO  L225             Difference]: With dead ends: 1171
[2025-01-09 08:08:24,088 INFO  L226             Difference]: Without dead ends: 687
[2025-01-09 08:08:24,089 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-01-09 08:08:24,093 INFO  L435           NwaCegarLoop]: 550 mSDtfsCounter, 1277 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:24,093 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1647 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:08:24,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 687 states.
[2025-01-09 08:08:24,106 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687.
[2025-01-09 08:08:24,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 687 states, 686 states have (on average 1.4620991253644315) internal successors, (1003), 686 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:24,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1003 transitions.
[2025-01-09 08:08:24,109 INFO  L78                 Accepts]: Start accepts. Automaton has 687 states and 1003 transitions. Word has length 221
[2025-01-09 08:08:24,110 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:24,110 INFO  L471      AbstractCegarLoop]: Abstraction has 687 states and 1003 transitions.
[2025-01-09 08:08:24,110 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:24,110 INFO  L276                IsEmpty]: Start isEmpty. Operand 687 states and 1003 transitions.
[2025-01-09 08:08:24,112 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-01-09 08:08:24,112 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:24,112 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:24,112 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-01-09 08:08:24,112 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:24,113 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:24,113 INFO  L85        PathProgramCache]: Analyzing trace with hash 2144206562, now seen corresponding path program 1 times
[2025-01-09 08:08:24,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:24,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308150739]
[2025-01-09 08:08:24,113 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:24,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:24,176 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-01-09 08:08:24,689 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-01-09 08:08:24,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:24,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:25,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:25,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:25,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308150739]
[2025-01-09 08:08:25,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308150739] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-09 08:08:25,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316483004]
[2025-01-09 08:08:25,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:25,732 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 08:08:25,732 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 08:08:25,735 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-09 08:08:25,737 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-01-09 08:08:26,227 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-01-09 08:08:26,574 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-01-09 08:08:26,574 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:26,574 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:26,584 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 57 conjuncts are in the unsatisfiable core
[2025-01-09 08:08:26,597 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-09 08:08:27,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:27,590 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-09 08:08:28,533 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:28,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316483004] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-09 08:08:28,534 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-09 08:08:28,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 11] total 31
[2025-01-09 08:08:28,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190332253]
[2025-01-09 08:08:28,534 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-09 08:08:28,535 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2025-01-09 08:08:28,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:28,536 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2025-01-09 08:08:28,536 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930
[2025-01-09 08:08:28,537 INFO  L87              Difference]: Start difference. First operand 687 states and 1003 transitions. Second operand  has 31 states, 31 states have (on average 20.93548387096774) internal successors, (649), 31 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:29,839 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:29,840 INFO  L93              Difference]: Finished difference Result 2008 states and 2931 transitions.
[2025-01-09 08:08:29,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-01-09 08:08:29,841 INFO  L78                 Accepts]: Start accepts. Automaton has  has 31 states, 31 states have (on average 20.93548387096774) internal successors, (649), 31 states have internal predecessors, (649), 0 states have call successors, (0), 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 221
[2025-01-09 08:08:29,841 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:29,846 INFO  L225             Difference]: With dead ends: 2008
[2025-01-09 08:08:29,846 INFO  L226             Difference]: Without dead ends: 1396
[2025-01-09 08:08:29,848 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482
[2025-01-09 08:08:29,849 INFO  L435           NwaCegarLoop]: 901 mSDtfsCounter, 4967 mSDsluCounter, 14394 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4967 SdHoareTripleChecker+Valid, 15295 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:29,849 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4967 Valid, 15295 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-01-09 08:08:29,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1396 states.
[2025-01-09 08:08:29,878 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1016.
[2025-01-09 08:08:29,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1016 states, 1015 states have (on average 1.4532019704433496) internal successors, (1475), 1015 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:29,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1475 transitions.
[2025-01-09 08:08:29,882 INFO  L78                 Accepts]: Start accepts. Automaton has 1016 states and 1475 transitions. Word has length 221
[2025-01-09 08:08:29,882 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:29,882 INFO  L471      AbstractCegarLoop]: Abstraction has 1016 states and 1475 transitions.
[2025-01-09 08:08:29,883 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 20.93548387096774) internal successors, (649), 31 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:29,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 1016 states and 1475 transitions.
[2025-01-09 08:08:29,884 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2025-01-09 08:08:29,884 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:29,884 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:29,898 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-01-09 08:08:30,085 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 08:08:30,085 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:30,086 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:30,086 INFO  L85        PathProgramCache]: Analyzing trace with hash -1886729116, now seen corresponding path program 1 times
[2025-01-09 08:08:30,086 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:30,086 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329517094]
[2025-01-09 08:08:30,086 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:30,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:30,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-01-09 08:08:30,216 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-01-09 08:08:30,216 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:30,216 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:30,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:30,492 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:30,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329517094]
[2025-01-09 08:08:30,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329517094] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:30,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:30,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:08:30,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769732203]
[2025-01-09 08:08:30,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:30,493 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:08:30,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:30,494 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:08:30,495 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:08:30,495 INFO  L87              Difference]: Start difference. First operand 1016 states and 1475 transitions. Second operand  has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:30,548 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:30,548 INFO  L93              Difference]: Finished difference Result 1645 states and 2394 transitions.
[2025-01-09 08:08:30,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:30,548 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222
[2025-01-09 08:08:30,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:30,550 INFO  L225             Difference]: With dead ends: 1645
[2025-01-09 08:08:30,550 INFO  L226             Difference]: Without dead ends: 1031
[2025-01-09 08:08:30,551 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 08:08:30,551 INFO  L435           NwaCegarLoop]: 552 mSDtfsCounter, 1405 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:30,552 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 1651 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 08:08:30,553 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1031 states.
[2025-01-09 08:08:30,563 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1013.
[2025-01-09 08:08:30,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1013 states, 1012 states have (on average 1.4515810276679841) internal successors, (1469), 1012 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:30,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1469 transitions.
[2025-01-09 08:08:30,567 INFO  L78                 Accepts]: Start accepts. Automaton has 1013 states and 1469 transitions. Word has length 222
[2025-01-09 08:08:30,567 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:30,567 INFO  L471      AbstractCegarLoop]: Abstraction has 1013 states and 1469 transitions.
[2025-01-09 08:08:30,567 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:30,567 INFO  L276                IsEmpty]: Start isEmpty. Operand 1013 states and 1469 transitions.
[2025-01-09 08:08:30,569 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2025-01-09 08:08:30,569 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:30,569 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:30,569 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-01-09 08:08:30,569 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:30,570 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:30,570 INFO  L85        PathProgramCache]: Analyzing trace with hash -786296213, now seen corresponding path program 1 times
[2025-01-09 08:08:30,570 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:30,570 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672596714]
[2025-01-09 08:08:30,570 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:30,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:30,630 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-01-09 08:08:30,709 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-01-09 08:08:30,709 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:30,709 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:30,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:30,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:30,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672596714]
[2025-01-09 08:08:30,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672596714] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:30,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:30,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-01-09 08:08:30,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799181847]
[2025-01-09 08:08:30,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:30,960 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 08:08:30,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:30,961 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 08:08:30,961 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-01-09 08:08:30,961 INFO  L87              Difference]: Start difference. First operand 1013 states and 1469 transitions. Second operand  has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:31,011 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:31,011 INFO  L93              Difference]: Finished difference Result 1350 states and 1970 transitions.
[2025-01-09 08:08:31,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:08:31,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222
[2025-01-09 08:08:31,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:31,013 INFO  L225             Difference]: With dead ends: 1350
[2025-01-09 08:08:31,014 INFO  L226             Difference]: Without dead ends: 735
[2025-01-09 08:08:31,014 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-01-09 08:08:31,015 INFO  L435           NwaCegarLoop]: 551 mSDtfsCounter, 1375 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:31,015 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 1647 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 08:08:31,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 735 states.
[2025-01-09 08:08:31,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735.
[2025-01-09 08:08:31,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 735 states, 734 states have (on average 1.4591280653950953) internal successors, (1071), 734 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:31,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1071 transitions.
[2025-01-09 08:08:31,025 INFO  L78                 Accepts]: Start accepts. Automaton has 735 states and 1071 transitions. Word has length 222
[2025-01-09 08:08:31,026 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:31,026 INFO  L471      AbstractCegarLoop]: Abstraction has 735 states and 1071 transitions.
[2025-01-09 08:08:31,026 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:31,026 INFO  L276                IsEmpty]: Start isEmpty. Operand 735 states and 1071 transitions.
[2025-01-09 08:08:31,028 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 389
[2025-01-09 08:08:31,028 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:31,028 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:31,029 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-01-09 08:08:31,029 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:31,029 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:31,029 INFO  L85        PathProgramCache]: Analyzing trace with hash 1862192727, now seen corresponding path program 1 times
[2025-01-09 08:08:31,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:31,030 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381508]
[2025-01-09 08:08:31,030 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:31,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:31,108 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes.
[2025-01-09 08:08:33,257 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements.
[2025-01-09 08:08:33,258 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:33,258 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:34,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:34,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:34,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381508]
[2025-01-09 08:08:34,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381508] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:08:34,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:08:34,522 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-01-09 08:08:34,522 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016612701]
[2025-01-09 08:08:34,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:08:34,523 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-01-09 08:08:34,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:34,523 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-01-09 08:08:34,523 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-01-09 08:08:34,525 INFO  L87              Difference]: Start difference. First operand 735 states and 1071 transitions. Second operand  has 9 states, 9 states have (on average 43.111111111111114) internal successors, (388), 9 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:34,865 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:34,865 INFO  L93              Difference]: Finished difference Result 2012 states and 2974 transitions.
[2025-01-09 08:08:34,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-01-09 08:08:34,865 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 43.111111111111114) internal successors, (388), 9 states have internal predecessors, (388), 0 states have call successors, (0), 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 388
[2025-01-09 08:08:34,866 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:34,869 INFO  L225             Difference]: With dead ends: 2012
[2025-01-09 08:08:34,869 INFO  L226             Difference]: Without dead ends: 1675
[2025-01-09 08:08:34,870 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156
[2025-01-09 08:08:34,870 INFO  L435           NwaCegarLoop]: 919 mSDtfsCounter, 2032 mSDsluCounter, 4879 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 5798 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:34,870 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 5798 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-01-09 08:08:34,872 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1675 states.
[2025-01-09 08:08:34,885 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1089.
[2025-01-09 08:08:34,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1089 states, 1088 states have (on average 1.4678308823529411) internal successors, (1597), 1088 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:34,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1597 transitions.
[2025-01-09 08:08:34,889 INFO  L78                 Accepts]: Start accepts. Automaton has 1089 states and 1597 transitions. Word has length 388
[2025-01-09 08:08:34,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:34,889 INFO  L471      AbstractCegarLoop]: Abstraction has 1089 states and 1597 transitions.
[2025-01-09 08:08:34,889 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 43.111111111111114) internal successors, (388), 9 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:34,890 INFO  L276                IsEmpty]: Start isEmpty. Operand 1089 states and 1597 transitions.
[2025-01-09 08:08:34,892 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 390
[2025-01-09 08:08:34,892 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:34,892 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 08:08:34,893 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-01-09 08:08:34,893 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:34,893 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:34,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 246447038, now seen corresponding path program 1 times
[2025-01-09 08:08:34,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:34,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71854161]
[2025-01-09 08:08:34,894 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:34,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:34,975 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes.
[2025-01-09 08:08:37,117 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements.
[2025-01-09 08:08:37,117 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:37,117 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:40,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 192 backedges. 141 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:40,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:40,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71854161]
[2025-01-09 08:08:40,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71854161] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-09 08:08:40,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504606043]
[2025-01-09 08:08:40,431 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:40,431 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 08:08:40,431 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 08:08:40,434 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-09 08:08:40,440 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-01-09 08:08:41,126 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes.
[2025-01-09 08:08:41,634 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements.
[2025-01-09 08:08:41,634 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:41,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:41,645 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 73 conjuncts are in the unsatisfiable core
[2025-01-09 08:08:41,658 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-09 08:08:42,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 192 backedges. 141 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:42,993 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-09 08:08:44,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 192 backedges. 140 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:44,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504606043] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-09 08:08:44,616 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-09 08:08:44,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 36
[2025-01-09 08:08:44,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634949863]
[2025-01-09 08:08:44,616 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-09 08:08:44,617 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2025-01-09 08:08:44,617 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:44,618 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2025-01-09 08:08:44,618 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260
[2025-01-09 08:08:44,619 INFO  L87              Difference]: Start difference. First operand 1089 states and 1597 transitions. Second operand  has 36 states, 36 states have (on average 23.944444444444443) internal successors, (862), 36 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:46,999 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:46,999 INFO  L93              Difference]: Finished difference Result 2553 states and 3777 transitions.
[2025-01-09 08:08:46,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. 
[2025-01-09 08:08:47,000 INFO  L78                 Accepts]: Start accepts. Automaton has  has 36 states, 36 states have (on average 23.944444444444443) internal successors, (862), 36 states have internal predecessors, (862), 0 states have call successors, (0), 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 389
[2025-01-09 08:08:47,000 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:47,007 INFO  L225             Difference]: With dead ends: 2553
[2025-01-09 08:08:47,008 INFO  L226             Difference]: Without dead ends: 1885
[2025-01-09 08:08:47,011 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1171, Invalid=5149, Unknown=0, NotChecked=0, Total=6320
[2025-01-09 08:08:47,011 INFO  L435           NwaCegarLoop]: 840 mSDtfsCounter, 12228 mSDsluCounter, 14183 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12228 SdHoareTripleChecker+Valid, 15023 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:47,013 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [12228 Valid, 15023 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-01-09 08:08:47,015 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1885 states.
[2025-01-09 08:08:47,031 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1194.
[2025-01-09 08:08:47,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1194 states, 1193 states have (on average 1.465213746856664) internal successors, (1748), 1193 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:47,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1748 transitions.
[2025-01-09 08:08:47,034 INFO  L78                 Accepts]: Start accepts. Automaton has 1194 states and 1748 transitions. Word has length 389
[2025-01-09 08:08:47,035 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:47,035 INFO  L471      AbstractCegarLoop]: Abstraction has 1194 states and 1748 transitions.
[2025-01-09 08:08:47,035 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 36 states, 36 states have (on average 23.944444444444443) internal successors, (862), 36 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:47,036 INFO  L276                IsEmpty]: Start isEmpty. Operand 1194 states and 1748 transitions.
[2025-01-09 08:08:47,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 391
[2025-01-09 08:08:47,039 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:47,039 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:08:47,056 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-01-09 08:08:47,240 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 08:08:47,240 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:47,241 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:47,241 INFO  L85        PathProgramCache]: Analyzing trace with hash -1925666112, now seen corresponding path program 1 times
[2025-01-09 08:08:47,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:47,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122585760]
[2025-01-09 08:08:47,241 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:47,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:47,323 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes.
[2025-01-09 08:08:49,425 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements.
[2025-01-09 08:08:49,425 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:49,425 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:52,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 192 backedges. 139 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:52,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:08:52,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122585760]
[2025-01-09 08:08:52,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122585760] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-09 08:08:52,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027839888]
[2025-01-09 08:08:52,018 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:52,018 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 08:08:52,018 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 08:08:52,021 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-09 08:08:52,022 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-01-09 08:08:52,680 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes.
[2025-01-09 08:08:53,047 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements.
[2025-01-09 08:08:53,047 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:08:53,047 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:08:53,059 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2478 conjuncts, 74 conjuncts are in the unsatisfiable core
[2025-01-09 08:08:53,070 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-09 08:08:54,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 192 backedges. 45 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:54,347 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-09 08:08:55,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 192 backedges. 45 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:08:55,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027839888] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-09 08:08:55,886 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-09 08:08:55,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34
[2025-01-09 08:08:55,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553253754]
[2025-01-09 08:08:55,887 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-09 08:08:55,887 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2025-01-09 08:08:55,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:08:55,889 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2025-01-09 08:08:55,889 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122
[2025-01-09 08:08:55,889 INFO  L87              Difference]: Start difference. First operand 1194 states and 1748 transitions. Second operand  has 34 states, 34 states have (on average 32.23529411764706) internal successors, (1096), 34 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:58,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:08:58,347 INFO  L93              Difference]: Finished difference Result 3953 states and 5826 transitions.
[2025-01-09 08:08:58,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2025-01-09 08:08:58,348 INFO  L78                 Accepts]: Start accepts. Automaton has  has 34 states, 34 states have (on average 32.23529411764706) internal successors, (1096), 34 states have internal predecessors, (1096), 0 states have call successors, (0), 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 390
[2025-01-09 08:08:58,348 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:08:58,357 INFO  L225             Difference]: With dead ends: 3953
[2025-01-09 08:08:58,358 INFO  L226             Difference]: Without dead ends: 2898
[2025-01-09 08:08:58,361 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=900, Invalid=4070, Unknown=0, NotChecked=0, Total=4970
[2025-01-09 08:08:58,362 INFO  L435           NwaCegarLoop]: 857 mSDtfsCounter, 12498 mSDsluCounter, 13826 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12498 SdHoareTripleChecker+Valid, 14683 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-01-09 08:08:58,362 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [12498 Valid, 14683 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2658 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-01-09 08:08:58,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2898 states.
[2025-01-09 08:08:58,392 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2497.
[2025-01-09 08:08:58,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2497 states, 2496 states have (on average 1.470753205128205) internal successors, (3671), 2496 states have internal predecessors, (3671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:58,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 3671 transitions.
[2025-01-09 08:08:58,399 INFO  L78                 Accepts]: Start accepts. Automaton has 2497 states and 3671 transitions. Word has length 390
[2025-01-09 08:08:58,400 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:08:58,400 INFO  L471      AbstractCegarLoop]: Abstraction has 2497 states and 3671 transitions.
[2025-01-09 08:08:58,400 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 32.23529411764706) internal successors, (1096), 34 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 08:08:58,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 2497 states and 3671 transitions.
[2025-01-09 08:08:58,403 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 394
[2025-01-09 08:08:58,403 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:08:58,404 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 08:08:58,420 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-01-09 08:08:58,604 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-01-09 08:08:58,605 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:08:58,605 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:08:58,605 INFO  L85        PathProgramCache]: Analyzing trace with hash -605102104, now seen corresponding path program 1 times
[2025-01-09 08:08:58,605 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:08:58,605 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027441676]
[2025-01-09 08:08:58,605 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:08:58,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:08:58,667 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes.
[2025-01-09 08:09:00,389 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements.
[2025-01-09 08:09:00,389 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:09:00,389 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:09:01,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 194 backedges. 164 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:09:01,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:09:01,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027441676]
[2025-01-09 08:09:01,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027441676] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-09 08:09:01,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77954448]
[2025-01-09 08:09:01,123 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:09:01,123 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 08:09:01,123 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 08:09:01,125 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-09 08:09:01,126 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-01-09 08:09:01,766 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes.