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


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label32.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6a56bada7206875b5522c4732ed558727da026e7bf600ff2a0cdce747605d25
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 14:55:53,578 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 14:55:53,623 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 14:55:53,630 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 14:55:53,631 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 14:55:53,650 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 14:55:53,650 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 14:55:53,651 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 14:55:53,651 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 14:55:53,651 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 14:55:53,651 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 14:55:53,651 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 14:55:53,651 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 14:55:53,651 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 14:55:53,652 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 14:55:53,652 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 14:55:53,653 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 14:55:53,653 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 14:55:53,653 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 14:55:53,653 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 14:55:53,653 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 14:55:53,653 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 14:55:53,653 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 14:55:53,653 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 14:55:53,653 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 14:55:53,653 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 14:55:53,653 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 14:55:53,654 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 14:55:53,654 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 14:55:53,654 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 14:55:53,654 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 14:55:53,654 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 14:55:53,654 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 14:55:53,654 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 14:55:53,654 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6a56bada7206875b5522c4732ed558727da026e7bf600ff2a0cdce747605d25
[2025-03-16 14:55:53,857 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 14:55:53,864 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 14:55:53,865 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 14:55:53,866 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 14:55:53,866 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 14:55:53,867 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label32.c
[2025-03-16 14:55:55,022 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4989b034/66d0b6a8971e4c9db4dcc9b0132f9316/FLAG12e86c27a
[2025-03-16 14:55:55,507 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 14:55:55,509 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label32.c
[2025-03-16 14:55:55,539 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4989b034/66d0b6a8971e4c9db4dcc9b0132f9316/FLAG12e86c27a
[2025-03-16 14:55:55,599 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4989b034/66d0b6a8971e4c9db4dcc9b0132f9316
[2025-03-16 14:55:55,601 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 14:55:55,603 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 14:55:55,605 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 14:55:55,605 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 14:55:55,608 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 14:55:55,609 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:55:55" (1/1) ...
[2025-03-16 14:55:55,610 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468894bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:55, skipping insertion in model container
[2025-03-16 14:55:55,610 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:55:55" (1/1) ...
[2025-03-16 14:55:55,687 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 14:55:55,859 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label32.c[5470,5483]
[2025-03-16 14:55:56,278 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 14:55:56,291 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 14:55:56,309 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label32.c[5470,5483]
[2025-03-16 14:55:56,559 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 14:55:56,575 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 14:55:56,576 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56 WrapperNode
[2025-03-16 14:55:56,576 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 14:55:56,577 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 14:55:56,577 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 14:55:56,577 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 14:55:56,581 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:56,626 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:56,842 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-03-16 14:55:56,842 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 14:55:56,843 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 14:55:56,843 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 14:55:56,843 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 14:55:56,849 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:56,849 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:56,884 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:57,054 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-16 14:55:57,054 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:57,055 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:57,163 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:57,179 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:57,198 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:57,212 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:57,251 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 14:55:57,252 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 14:55:57,253 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 14:55:57,253 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 14:55:57,254 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (1/1) ...
[2025-03-16 14:55:57,257 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 14:55:57,266 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:55:57,278 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-16 14:55:57,283 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-16 14:55:57,297 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 14:55:57,297 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 14:55:57,297 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 14:55:57,297 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 14:55:57,342 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 14:55:57,343 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 14:56:00,384 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-03-16 14:56:00,385 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-03-16 14:56:00,385 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-03-16 14:56:00,537 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-03-16 14:56:00,538 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 14:56:00,565 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 14:56:00,569 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 14:56:00,570 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:56:00 BoogieIcfgContainer
[2025-03-16 14:56:00,570 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 14:56:00,572 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 14:56:00,572 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 14:56:00,576 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 14:56:00,576 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:55:55" (1/3) ...
[2025-03-16 14:56:00,576 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d16f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:56:00, skipping insertion in model container
[2025-03-16 14:56:00,576 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:56" (2/3) ...
[2025-03-16 14:56:00,576 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d16f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:56:00, skipping insertion in model container
[2025-03-16 14:56:00,577 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:56:00" (3/3) ...
[2025-03-16 14:56:00,577 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label32.c
[2025-03-16 14:56:00,587 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 14:56:00,588 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label32.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 14:56:00,649 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 14:56:00,656 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;@1f96d0bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 14:56:00,656 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 14:56:00,664 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:00,668 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-03-16 14:56:00,668 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:00,668 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:00,669 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:00,672 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:00,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -489696908, now seen corresponding path program 1 times
[2025-03-16 14:56:00,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:00,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946838915]
[2025-03-16 14:56:00,677 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:00,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:00,732 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-03-16 14:56:00,745 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-03-16 14:56:00,746 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:00,746 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:00,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:56:00,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:00,793 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946838915]
[2025-03-16 14:56:00,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946838915] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:00,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:00,794 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:56:00,795 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920490934]
[2025-03-16 14:56:00,796 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:00,798 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 14:56:00,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:00,812 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 14:56:00,813 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 14:56:00,816 INFO  L87              Difference]: Start difference. First operand  has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:00,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:00,895 INFO  L93              Difference]: Finished difference Result 1513 states and 3005 transitions.
[2025-03-16 14:56:00,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 14:56:00,896 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42
[2025-03-16 14:56:00,896 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:00,905 INFO  L225             Difference]: With dead ends: 1513
[2025-03-16 14:56:00,905 INFO  L226             Difference]: Without dead ends: 754
[2025-03-16 14:56:00,909 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 14:56:00,911 INFO  L435           NwaCegarLoop]: 1441 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:00,911 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 14:56:00,923 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 754 states.
[2025-03-16 14:56:00,970 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754.
[2025-03-16 14:56:00,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:00,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions.
[2025-03-16 14:56:00,983 INFO  L78                 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 42
[2025-03-16 14:56:00,984 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:00,984 INFO  L471      AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions.
[2025-03-16 14:56:00,984 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:00,984 INFO  L276                IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions.
[2025-03-16 14:56:00,985 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-03-16 14:56:00,985 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:00,985 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:00,985 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 14:56:00,985 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:00,986 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:00,986 INFO  L85        PathProgramCache]: Analyzing trace with hash -1586302219, now seen corresponding path program 1 times
[2025-03-16 14:56:00,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:00,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667581573]
[2025-03-16 14:56:00,986 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:00,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:01,000 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-03-16 14:56:01,034 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-03-16 14:56:01,037 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:01,037 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:01,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:56:01,197 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:01,197 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667581573]
[2025-03-16 14:56:01,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667581573] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:01,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:01,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:56:01,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127453329]
[2025-03-16 14:56:01,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:01,198 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:01,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:01,199 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:01,199 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:01,200 INFO  L87              Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:03,838 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:03,838 INFO  L93              Difference]: Finished difference Result 2258 states and 4311 transitions.
[2025-03-16 14:56:03,839 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:03,839 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42
[2025-03-16 14:56:03,839 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:03,847 INFO  L225             Difference]: With dead ends: 2258
[2025-03-16 14:56:03,847 INFO  L226             Difference]: Without dead ends: 1505
[2025-03-16 14:56:03,848 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:03,848 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 750 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:03,849 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 85 Invalid, 3144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-03-16 14:56:03,853 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1505 states.
[2025-03-16 14:56:03,892 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505.
[2025-03-16 14:56:03,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1505 states, 1504 states have (on average 1.8663563829787233) internal successors, (2807), 1504 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:03,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2807 transitions.
[2025-03-16 14:56:03,903 INFO  L78                 Accepts]: Start accepts. Automaton has 1505 states and 2807 transitions. Word has length 42
[2025-03-16 14:56:03,903 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:03,903 INFO  L471      AbstractCegarLoop]: Abstraction has 1505 states and 2807 transitions.
[2025-03-16 14:56:03,903 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:03,903 INFO  L276                IsEmpty]: Start isEmpty. Operand 1505 states and 2807 transitions.
[2025-03-16 14:56:03,906 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-16 14:56:03,906 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:03,907 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:56:03,907 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 14:56:03,907 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:03,908 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:03,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 999168246, now seen corresponding path program 1 times
[2025-03-16 14:56:03,908 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:03,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475047484]
[2025-03-16 14:56:03,908 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:03,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:03,927 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-16 14:56:03,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-16 14:56:03,945 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:03,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:04,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:56:04,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:04,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475047484]
[2025-03-16 14:56:04,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475047484] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:04,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:04,084 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:56:04,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016428221]
[2025-03-16 14:56:04,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:04,084 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:04,085 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:04,085 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:04,085 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:04,085 INFO  L87              Difference]: Start difference. First operand 1505 states and 2807 transitions. Second operand  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:06,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:06,553 INFO  L93              Difference]: Finished difference Result 4513 states and 8419 transitions.
[2025-03-16 14:56:06,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:06,554 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107
[2025-03-16 14:56:06,554 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:06,565 INFO  L225             Difference]: With dead ends: 4513
[2025-03-16 14:56:06,566 INFO  L226             Difference]: Without dead ends: 3009
[2025-03-16 14:56:06,569 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:06,571 INFO  L435           NwaCegarLoop]: 345 mSDtfsCounter, 926 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:06,571 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 352 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-16 14:56:06,575 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3009 states.
[2025-03-16 14:56:06,619 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3007.
[2025-03-16 14:56:06,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3007 states, 3006 states have (on average 1.6513639387890884) internal successors, (4964), 3006 states have internal predecessors, (4964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:06,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4964 transitions.
[2025-03-16 14:56:06,627 INFO  L78                 Accepts]: Start accepts. Automaton has 3007 states and 4964 transitions. Word has length 107
[2025-03-16 14:56:06,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:06,629 INFO  L471      AbstractCegarLoop]: Abstraction has 3007 states and 4964 transitions.
[2025-03-16 14:56:06,629 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:06,629 INFO  L276                IsEmpty]: Start isEmpty. Operand 3007 states and 4964 transitions.
[2025-03-16 14:56:06,630 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-03-16 14:56:06,630 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:06,630 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:06,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 14:56:06,630 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:06,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:06,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -881934683, now seen corresponding path program 1 times
[2025-03-16 14:56:06,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:06,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198867633]
[2025-03-16 14:56:06,630 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:06,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:06,644 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-16 14:56:06,664 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-16 14:56:06,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:06,665 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:06,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:56:06,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:06,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198867633]
[2025-03-16 14:56:06,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198867633] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:06,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:06,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:06,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491455833]
[2025-03-16 14:56:06,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:06,915 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:56:06,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:06,916 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:56:06,916 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:56:06,916 INFO  L87              Difference]: Start difference. First operand 3007 states and 4964 transitions. Second operand  has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:09,343 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:09,343 INFO  L93              Difference]: Finished difference Result 7552 states and 12121 transitions.
[2025-03-16 14:56:09,343 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:56:09,343 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113
[2025-03-16 14:56:09,344 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:09,356 INFO  L225             Difference]: With dead ends: 7552
[2025-03-16 14:56:09,356 INFO  L226             Difference]: Without dead ends: 4509
[2025-03-16 14:56:09,359 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:56:09,360 INFO  L435           NwaCegarLoop]: 589 mSDtfsCounter, 688 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 4003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 3675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:09,360 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 606 Invalid, 4003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 3675 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-16 14:56:09,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4509 states.
[2025-03-16 14:56:09,412 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 4509.
[2025-03-16 14:56:09,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4509 states, 4508 states have (on average 1.4514196983141083) internal successors, (6543), 4508 states have internal predecessors, (6543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:09,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 6543 transitions.
[2025-03-16 14:56:09,423 INFO  L78                 Accepts]: Start accepts. Automaton has 4509 states and 6543 transitions. Word has length 113
[2025-03-16 14:56:09,423 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:09,423 INFO  L471      AbstractCegarLoop]: Abstraction has 4509 states and 6543 transitions.
[2025-03-16 14:56:09,423 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:09,423 INFO  L276                IsEmpty]: Start isEmpty. Operand 4509 states and 6543 transitions.
[2025-03-16 14:56:09,426 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2025-03-16 14:56:09,426 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:09,427 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:09,427 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 14:56:09,427 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:09,427 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:09,427 INFO  L85        PathProgramCache]: Analyzing trace with hash 626728279, now seen corresponding path program 1 times
[2025-03-16 14:56:09,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:09,427 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093635046]
[2025-03-16 14:56:09,427 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:09,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:09,446 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.
[2025-03-16 14:56:09,459 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements.
[2025-03-16 14:56:09,460 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:09,460 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:09,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:56:09,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:09,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093635046]
[2025-03-16 14:56:09,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093635046] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:09,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:09,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:09,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293985805]
[2025-03-16 14:56:09,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:09,692 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:56:09,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:09,693 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:56:09,693 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:56:09,693 INFO  L87              Difference]: Start difference. First operand 4509 states and 6543 transitions. Second operand  has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:12,649 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:12,649 INFO  L93              Difference]: Finished difference Result 14282 states and 20459 transitions.
[2025-03-16 14:56:12,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 14:56:12,650 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158
[2025-03-16 14:56:12,650 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:12,676 INFO  L225             Difference]: With dead ends: 14282
[2025-03-16 14:56:12,676 INFO  L226             Difference]: Without dead ends: 9774
[2025-03-16 14:56:12,684 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:56:12,685 INFO  L435           NwaCegarLoop]: 364 mSDtfsCounter, 2131 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2131 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:12,685 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2131 Valid, 380 Invalid, 4619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-03-16 14:56:12,693 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9774 states.
[2025-03-16 14:56:12,789 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 9766.
[2025-03-16 14:56:12,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9766 states, 9765 states have (on average 1.3654889912954429) internal successors, (13334), 9765 states have internal predecessors, (13334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:12,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 13334 transitions.
[2025-03-16 14:56:12,816 INFO  L78                 Accepts]: Start accepts. Automaton has 9766 states and 13334 transitions. Word has length 158
[2025-03-16 14:56:12,816 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:12,816 INFO  L471      AbstractCegarLoop]: Abstraction has 9766 states and 13334 transitions.
[2025-03-16 14:56:12,817 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:12,817 INFO  L276                IsEmpty]: Start isEmpty. Operand 9766 states and 13334 transitions.
[2025-03-16 14:56:12,818 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 188
[2025-03-16 14:56:12,819 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:12,819 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:12,819 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 14:56:12,819 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:12,820 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:12,820 INFO  L85        PathProgramCache]: Analyzing trace with hash -1572817730, now seen corresponding path program 1 times
[2025-03-16 14:56:12,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:12,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808535908]
[2025-03-16 14:56:12,820 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:12,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:12,884 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes.
[2025-03-16 14:56:12,897 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements.
[2025-03-16 14:56:12,898 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:12,898 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:13,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:56:13,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:13,110 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808535908]
[2025-03-16 14:56:13,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808535908] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:56:13,110 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410348003]
[2025-03-16 14:56:13,110 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:13,110 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:56:13,113 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:56:13,115 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:56:13,116 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-16 14:56:13,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes.
[2025-03-16 14:56:13,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements.
[2025-03-16 14:56:13,189 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:13,189 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:13,191 INFO  L256         TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:56:13,196 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:56:13,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-03-16 14:56:13,379 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:56:13,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410348003] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:13,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:56:13,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-16 14:56:13,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425957659]
[2025-03-16 14:56:13,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:13,380 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:13,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:13,380 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:13,380 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:56:13,380 INFO  L87              Difference]: Start difference. First operand 9766 states and 13334 transitions. Second operand  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:15,404 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:15,404 INFO  L93              Difference]: Finished difference Result 27041 states and 37588 transitions.
[2025-03-16 14:56:15,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:15,405 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187
[2025-03-16 14:56:15,405 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:15,440 INFO  L225             Difference]: With dead ends: 27041
[2025-03-16 14:56:15,440 INFO  L226             Difference]: Without dead ends: 17276
[2025-03-16 14:56:15,447 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:56:15,447 INFO  L435           NwaCegarLoop]: 367 mSDtfsCounter, 660 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:15,448 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 374 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-16 14:56:15,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17276 states.
[2025-03-16 14:56:15,591 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 14272.
[2025-03-16 14:56:15,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14272 states, 14271 states have (on average 1.4217644173498705) internal successors, (20290), 14271 states have internal predecessors, (20290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:15,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14272 states to 14272 states and 20290 transitions.
[2025-03-16 14:56:15,625 INFO  L78                 Accepts]: Start accepts. Automaton has 14272 states and 20290 transitions. Word has length 187
[2025-03-16 14:56:15,625 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:15,625 INFO  L471      AbstractCegarLoop]: Abstraction has 14272 states and 20290 transitions.
[2025-03-16 14:56:15,625 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:15,625 INFO  L276                IsEmpty]: Start isEmpty. Operand 14272 states and 20290 transitions.
[2025-03-16 14:56:15,627 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-16 14:56:15,627 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:15,628 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:15,634 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-16 14:56:15,832 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-03-16 14:56:15,832 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:15,832 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:15,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 1278068678, now seen corresponding path program 1 times
[2025-03-16 14:56:15,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:15,833 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508110272]
[2025-03-16 14:56:15,833 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:15,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:15,848 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-16 14:56:15,862 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-16 14:56:15,863 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:15,863 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:16,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-03-16 14:56:16,089 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:16,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508110272]
[2025-03-16 14:56:16,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508110272] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:16,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:16,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:16,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013741753]
[2025-03-16 14:56:16,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:16,090 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:56:16,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:16,090 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:56:16,090 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:56:16,090 INFO  L87              Difference]: Start difference. First operand 14272 states and 20290 transitions. Second operand  has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:18,573 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:18,573 INFO  L93              Difference]: Finished difference Result 28582 states and 40617 transitions.
[2025-03-16 14:56:18,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:56:18,574 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 254
[2025-03-16 14:56:18,575 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:18,601 INFO  L225             Difference]: With dead ends: 28582
[2025-03-16 14:56:18,602 INFO  L226             Difference]: Without dead ends: 14274
[2025-03-16 14:56:18,613 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:56:18,614 INFO  L435           NwaCegarLoop]: 386 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:18,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 400 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-16 14:56:18,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14274 states.
[2025-03-16 14:56:18,753 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14274 to 14272.
[2025-03-16 14:56:18,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14272 states, 14271 states have (on average 1.3898115058510265) internal successors, (19834), 14271 states have internal predecessors, (19834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:18,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14272 states to 14272 states and 19834 transitions.
[2025-03-16 14:56:18,791 INFO  L78                 Accepts]: Start accepts. Automaton has 14272 states and 19834 transitions. Word has length 254
[2025-03-16 14:56:18,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:18,791 INFO  L471      AbstractCegarLoop]: Abstraction has 14272 states and 19834 transitions.
[2025-03-16 14:56:18,792 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:18,792 INFO  L276                IsEmpty]: Start isEmpty. Operand 14272 states and 19834 transitions.
[2025-03-16 14:56:18,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 277
[2025-03-16 14:56:18,798 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:18,798 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:18,798 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 14:56:18,798 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:18,799 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:18,799 INFO  L85        PathProgramCache]: Analyzing trace with hash -472227363, now seen corresponding path program 1 times
[2025-03-16 14:56:18,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:18,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487887476]
[2025-03-16 14:56:18,799 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:18,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:18,816 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes.
[2025-03-16 14:56:18,828 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements.
[2025-03-16 14:56:18,828 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:18,829 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:18,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 173 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2025-03-16 14:56:18,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:18,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487887476]
[2025-03-16 14:56:18,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487887476] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:18,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:18,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:56:18,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74173663]
[2025-03-16 14:56:18,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:18,933 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:18,934 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:18,934 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:18,934 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:18,934 INFO  L87              Difference]: Start difference. First operand 14272 states and 19834 transitions. Second operand  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:20,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:20,893 INFO  L93              Difference]: Finished difference Result 36053 states and 50016 transitions.
[2025-03-16 14:56:20,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:20,893 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 276
[2025-03-16 14:56:20,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:20,923 INFO  L225             Difference]: With dead ends: 36053
[2025-03-16 14:56:20,924 INFO  L226             Difference]: Without dead ends: 21782
[2025-03-16 14:56:20,933 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:20,933 INFO  L435           NwaCegarLoop]: 415 mSDtfsCounter, 694 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:20,934 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 421 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [782 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-16 14:56:20,949 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21782 states.
[2025-03-16 14:56:21,073 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21782 to 18778.
[2025-03-16 14:56:21,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18778 states, 18777 states have (on average 1.2279384353198062) internal successors, (23057), 18777 states have internal predecessors, (23057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:21,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18778 states to 18778 states and 23057 transitions.
[2025-03-16 14:56:21,108 INFO  L78                 Accepts]: Start accepts. Automaton has 18778 states and 23057 transitions. Word has length 276
[2025-03-16 14:56:21,109 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:21,109 INFO  L471      AbstractCegarLoop]: Abstraction has 18778 states and 23057 transitions.
[2025-03-16 14:56:21,109 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:21,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 18778 states and 23057 transitions.
[2025-03-16 14:56:21,112 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 356
[2025-03-16 14:56:21,113 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:21,113 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-16 14:56:21,114 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 14:56:21,114 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:21,114 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:21,114 INFO  L85        PathProgramCache]: Analyzing trace with hash -1620929993, now seen corresponding path program 1 times
[2025-03-16 14:56:21,114 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:21,114 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314357088]
[2025-03-16 14:56:21,115 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:21,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:21,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes.
[2025-03-16 14:56:21,154 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements.
[2025-03-16 14:56:21,154 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:21,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:21,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 371 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-03-16 14:56:21,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:21,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314357088]
[2025-03-16 14:56:21,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314357088] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:21,288 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:21,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:21,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980402565]
[2025-03-16 14:56:21,288 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:21,288 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:21,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:21,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:21,289 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:21,289 INFO  L87              Difference]: Start difference. First operand 18778 states and 23057 transitions. Second operand  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:23,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:23,511 INFO  L93              Difference]: Finished difference Result 45065 states and 56462 transitions.
[2025-03-16 14:56:23,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:23,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 355
[2025-03-16 14:56:23,512 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:23,545 INFO  L225             Difference]: With dead ends: 45065
[2025-03-16 14:56:23,546 INFO  L226             Difference]: Without dead ends: 26288
[2025-03-16 14:56:23,556 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:23,557 INFO  L435           NwaCegarLoop]: 228 mSDtfsCounter, 764 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:23,557 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 234 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-16 14:56:23,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26288 states.
[2025-03-16 14:56:23,726 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26288 to 26288.
[2025-03-16 14:56:23,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26288 states, 26287 states have (on average 1.2197664244683684) internal successors, (32064), 26287 states have internal predecessors, (32064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:23,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26288 states to 26288 states and 32064 transitions.
[2025-03-16 14:56:23,774 INFO  L78                 Accepts]: Start accepts. Automaton has 26288 states and 32064 transitions. Word has length 355
[2025-03-16 14:56:23,774 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:23,774 INFO  L471      AbstractCegarLoop]: Abstraction has 26288 states and 32064 transitions.
[2025-03-16 14:56:23,774 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:23,775 INFO  L276                IsEmpty]: Start isEmpty. Operand 26288 states and 32064 transitions.
[2025-03-16 14:56:23,779 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 371
[2025-03-16 14:56:23,779 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:23,780 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:56:23,780 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 14:56:23,780 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:23,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:23,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -849004760, now seen corresponding path program 1 times
[2025-03-16 14:56:23,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:23,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247892386]
[2025-03-16 14:56:23,783 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:23,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:23,810 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes.
[2025-03-16 14:56:23,830 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements.
[2025-03-16 14:56:23,830 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:23,830 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:23,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 386 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2025-03-16 14:56:23,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:23,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247892386]
[2025-03-16 14:56:23,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247892386] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:23,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:23,950 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:23,950 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049891133]
[2025-03-16 14:56:23,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:23,950 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:23,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:23,951 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:23,951 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:23,951 INFO  L87              Difference]: Start difference. First operand 26288 states and 32064 transitions. Second operand  has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:25,951 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:25,951 INFO  L93              Difference]: Finished difference Result 66093 states and 80107 transitions.
[2025-03-16 14:56:25,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:25,952 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 370
[2025-03-16 14:56:25,952 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:25,992 INFO  L225             Difference]: With dead ends: 66093
[2025-03-16 14:56:25,992 INFO  L226             Difference]: Without dead ends: 39806
[2025-03-16 14:56:26,008 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:26,009 INFO  L435           NwaCegarLoop]: 1325 mSDtfsCounter, 740 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:26,009 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1332 Invalid, 2695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-16 14:56:26,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39806 states.
[2025-03-16 14:56:26,277 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39806 to 38304.
[2025-03-16 14:56:26,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38304 states, 38303 states have (on average 1.1794898571913428) internal successors, (45178), 38303 states have internal predecessors, (45178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:26,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38304 states to 38304 states and 45178 transitions.
[2025-03-16 14:56:26,343 INFO  L78                 Accepts]: Start accepts. Automaton has 38304 states and 45178 transitions. Word has length 370
[2025-03-16 14:56:26,343 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:26,343 INFO  L471      AbstractCegarLoop]: Abstraction has 38304 states and 45178 transitions.
[2025-03-16 14:56:26,343 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:26,343 INFO  L276                IsEmpty]: Start isEmpty. Operand 38304 states and 45178 transitions.
[2025-03-16 14:56:26,350 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 460
[2025-03-16 14:56:26,350 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:26,350 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:26,351 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 14:56:26,351 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:26,351 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:26,351 INFO  L85        PathProgramCache]: Analyzing trace with hash 1643808893, now seen corresponding path program 1 times
[2025-03-16 14:56:26,351 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:26,351 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003784476]
[2025-03-16 14:56:26,351 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:26,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:26,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes.
[2025-03-16 14:56:26,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements.
[2025-03-16 14:56:26,401 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:26,401 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:26,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 664 backedges. 513 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked.
[2025-03-16 14:56:26,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:26,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003784476]
[2025-03-16 14:56:26,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003784476] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:26,619 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:26,619 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:26,620 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723943428]
[2025-03-16 14:56:26,620 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:26,620 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:26,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:26,621 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:26,621 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:26,621 INFO  L87              Difference]: Start difference. First operand 38304 states and 45178 transitions. Second operand  has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:28,928 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:28,929 INFO  L93              Difference]: Finished difference Result 93880 states and 110806 transitions.
[2025-03-16 14:56:28,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:28,929 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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 459
[2025-03-16 14:56:28,929 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:28,990 INFO  L225             Difference]: With dead ends: 93880
[2025-03-16 14:56:28,991 INFO  L226             Difference]: Without dead ends: 55577
[2025-03-16 14:56:29,021 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:29,021 INFO  L435           NwaCegarLoop]: 1274 mSDtfsCounter, 639 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:29,021 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1281 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-16 14:56:29,059 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55577 states.
[2025-03-16 14:56:29,500 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55577 to 54826.
[2025-03-16 14:56:29,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54826 states, 54825 states have (on average 1.1693935248518013) internal successors, (64112), 54825 states have internal predecessors, (64112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:29,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54826 states to 54826 states and 64112 transitions.
[2025-03-16 14:56:29,592 INFO  L78                 Accepts]: Start accepts. Automaton has 54826 states and 64112 transitions. Word has length 459
[2025-03-16 14:56:29,593 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:29,593 INFO  L471      AbstractCegarLoop]: Abstraction has 54826 states and 64112 transitions.
[2025-03-16 14:56:29,593 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:29,593 INFO  L276                IsEmpty]: Start isEmpty. Operand 54826 states and 64112 transitions.
[2025-03-16 14:56:29,601 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 464
[2025-03-16 14:56:29,601 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:29,602 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:29,602 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 14:56:29,603 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:29,603 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:29,603 INFO  L85        PathProgramCache]: Analyzing trace with hash -1672003769, now seen corresponding path program 1 times
[2025-03-16 14:56:29,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:29,604 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95481400]
[2025-03-16 14:56:29,604 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:29,604 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:29,628 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes.
[2025-03-16 14:56:29,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements.
[2025-03-16 14:56:29,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:29,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:29,797 INFO  L134       CoverageAnalysis]: Checked inductivity of 664 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-03-16 14:56:29,797 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:29,797 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95481400]
[2025-03-16 14:56:29,797 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95481400] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:29,797 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:29,797 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:29,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473575231]
[2025-03-16 14:56:29,798 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:29,798 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:29,798 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:29,798 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:29,798 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:29,799 INFO  L87              Difference]: Start difference. First operand 54826 states and 64112 transitions. Second operand  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:32,016 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:32,016 INFO  L93              Difference]: Finished difference Result 113406 states and 132065 transitions.
[2025-03-16 14:56:32,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:32,017 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 463
[2025-03-16 14:56:32,017 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:32,063 INFO  L225             Difference]: With dead ends: 113406
[2025-03-16 14:56:32,063 INFO  L226             Difference]: Without dead ends: 54075
[2025-03-16 14:56:32,079 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:32,079 INFO  L435           NwaCegarLoop]: 1217 mSDtfsCounter, 725 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:32,079 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1224 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-16 14:56:32,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54075 states.
[2025-03-16 14:56:32,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54075 to 48067.
[2025-03-16 14:56:32,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48067 states, 48066 states have (on average 1.1182332625972622) internal successors, (53749), 48066 states have internal predecessors, (53749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:32,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48067 states to 48067 states and 53749 transitions.
[2025-03-16 14:56:32,459 INFO  L78                 Accepts]: Start accepts. Automaton has 48067 states and 53749 transitions. Word has length 463
[2025-03-16 14:56:32,459 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:32,459 INFO  L471      AbstractCegarLoop]: Abstraction has 48067 states and 53749 transitions.
[2025-03-16 14:56:32,460 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:32,460 INFO  L276                IsEmpty]: Start isEmpty. Operand 48067 states and 53749 transitions.
[2025-03-16 14:56:32,469 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 530
[2025-03-16 14:56:32,469 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:32,470 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:32,470 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 14:56:32,470 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:32,470 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:32,470 INFO  L85        PathProgramCache]: Analyzing trace with hash 152958090, now seen corresponding path program 1 times
[2025-03-16 14:56:32,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:32,471 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878571002]
[2025-03-16 14:56:32,471 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:32,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:32,498 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes.
[2025-03-16 14:56:32,514 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements.
[2025-03-16 14:56:32,514 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:32,514 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:33,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 746 backedges. 620 proven. 14 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2025-03-16 14:56:33,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:33,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878571002]
[2025-03-16 14:56:33,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878571002] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:56:33,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321895834]
[2025-03-16 14:56:33,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:33,091 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:56:33,091 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:56:33,093 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:56:33,094 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-16 14:56:33,146 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes.
[2025-03-16 14:56:33,221 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements.
[2025-03-16 14:56:33,221 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:33,221 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:33,223 INFO  L256         TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:56:33,233 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:56:33,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 746 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked.
[2025-03-16 14:56:33,351 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:56:33,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [321895834] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:33,351 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:56:33,351 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-16 14:56:33,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228876862]
[2025-03-16 14:56:33,351 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:33,352 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:33,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:33,352 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:33,352 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:56:33,352 INFO  L87              Difference]: Start difference. First operand 48067 states and 53749 transitions. Second operand  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:35,576 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:35,576 INFO  L93              Difference]: Finished difference Result 109651 states and 123925 transitions.
[2025-03-16 14:56:35,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:35,576 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 529
[2025-03-16 14:56:35,577 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:35,652 INFO  L225             Difference]: With dead ends: 109651
[2025-03-16 14:56:35,652 INFO  L226             Difference]: Without dead ends: 62336
[2025-03-16 14:56:35,676 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:56:35,678 INFO  L435           NwaCegarLoop]: 1365 mSDtfsCounter, 654 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:35,678 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1372 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-16 14:56:35,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62336 states.
[2025-03-16 14:56:36,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62336 to 60083.
[2025-03-16 14:56:36,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60083 states, 60082 states have (on average 1.1049232715289106) internal successors, (66386), 60082 states have internal predecessors, (66386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:36,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60083 states to 60083 states and 66386 transitions.
[2025-03-16 14:56:36,385 INFO  L78                 Accepts]: Start accepts. Automaton has 60083 states and 66386 transitions. Word has length 529
[2025-03-16 14:56:36,386 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:36,386 INFO  L471      AbstractCegarLoop]: Abstraction has 60083 states and 66386 transitions.
[2025-03-16 14:56:36,386 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:36,386 INFO  L276                IsEmpty]: Start isEmpty. Operand 60083 states and 66386 transitions.
[2025-03-16 14:56:36,406 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 611
[2025-03-16 14:56:36,406 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:36,406 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:36,413 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-16 14:56:36,607 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-03-16 14:56:36,607 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:36,607 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:36,608 INFO  L85        PathProgramCache]: Analyzing trace with hash 255742300, now seen corresponding path program 1 times
[2025-03-16 14:56:36,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:36,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610323040]
[2025-03-16 14:56:36,608 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:36,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:36,659 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes.
[2025-03-16 14:56:36,697 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements.
[2025-03-16 14:56:36,698 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:36,698 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:37,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 459 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked.
[2025-03-16 14:56:37,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:37,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610323040]
[2025-03-16 14:56:37,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610323040] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:37,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:37,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:37,202 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374352422]
[2025-03-16 14:56:37,202 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:37,203 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:56:37,203 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:37,203 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:56:37,204 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:56:37,204 INFO  L87              Difference]: Start difference. First operand 60083 states and 66386 transitions. Second operand  has 4 states, 4 states have (on average 93.25) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:40,761 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:40,761 INFO  L93              Difference]: Finished difference Result 180996 states and 201281 transitions.
[2025-03-16 14:56:40,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:56:40,763 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 93.25) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 610
[2025-03-16 14:56:40,763 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:40,901 INFO  L225             Difference]: With dead ends: 180996
[2025-03-16 14:56:40,902 INFO  L226             Difference]: Without dead ends: 121665
[2025-03-16 14:56:40,948 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:56:40,949 INFO  L435           NwaCegarLoop]: 19 mSDtfsCounter, 1684 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4665 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 4665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:40,949 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 32 Invalid, 5268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 4665 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-03-16 14:56:41,031 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121665 states.
[2025-03-16 14:56:42,008 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121665 to 120914.
[2025-03-16 14:56:42,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120914 states, 120913 states have (on average 1.108408525137909) internal successors, (134021), 120913 states have internal predecessors, (134021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:42,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 134021 transitions.
[2025-03-16 14:56:42,195 INFO  L78                 Accepts]: Start accepts. Automaton has 120914 states and 134021 transitions. Word has length 610
[2025-03-16 14:56:42,196 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:42,196 INFO  L471      AbstractCegarLoop]: Abstraction has 120914 states and 134021 transitions.
[2025-03-16 14:56:42,196 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 93.25) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:42,196 INFO  L276                IsEmpty]: Start isEmpty. Operand 120914 states and 134021 transitions.
[2025-03-16 14:56:42,216 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 618
[2025-03-16 14:56:42,216 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:42,216 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:42,216 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 14:56:42,216 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:42,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:42,217 INFO  L85        PathProgramCache]: Analyzing trace with hash -1224706124, now seen corresponding path program 1 times
[2025-03-16 14:56:42,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:42,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050995029]
[2025-03-16 14:56:42,217 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:42,217 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:42,246 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes.
[2025-03-16 14:56:42,262 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements.
[2025-03-16 14:56:42,262 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:42,262 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:42,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 681 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked.
[2025-03-16 14:56:42,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:42,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050995029]
[2025-03-16 14:56:42,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050995029] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:42,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:42,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:42,412 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732305589]
[2025-03-16 14:56:42,412 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:42,413 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:42,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:42,413 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:42,413 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:42,413 INFO  L87              Difference]: Start difference. First operand 120914 states and 134021 transitions. Second operand  has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:44,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:44,834 INFO  L93              Difference]: Finished difference Result 244080 states and 270330 transitions.
[2025-03-16 14:56:44,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:44,835 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 617
[2025-03-16 14:56:44,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:44,967 INFO  L225             Difference]: With dead ends: 244080
[2025-03-16 14:56:44,967 INFO  L226             Difference]: Without dead ends: 123918
[2025-03-16 14:56:45,031 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:45,031 INFO  L435           NwaCegarLoop]: 189 mSDtfsCounter, 734 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:45,032 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 195 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-16 14:56:45,107 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 123918 states.
[2025-03-16 14:56:46,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 123918 to 120914.
[2025-03-16 14:56:46,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120914 states, 120913 states have (on average 1.101701223193536) internal successors, (133210), 120913 states have internal predecessors, (133210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:46,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 133210 transitions.
[2025-03-16 14:56:46,497 INFO  L78                 Accepts]: Start accepts. Automaton has 120914 states and 133210 transitions. Word has length 617
[2025-03-16 14:56:46,497 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:46,497 INFO  L471      AbstractCegarLoop]: Abstraction has 120914 states and 133210 transitions.
[2025-03-16 14:56:46,497 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:46,497 INFO  L276                IsEmpty]: Start isEmpty. Operand 120914 states and 133210 transitions.
[2025-03-16 14:56:46,517 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 656
[2025-03-16 14:56:46,517 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:46,517 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:46,517 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 14:56:46,517 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:46,518 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:46,518 INFO  L85        PathProgramCache]: Analyzing trace with hash 787221097, now seen corresponding path program 1 times
[2025-03-16 14:56:46,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:46,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769537923]
[2025-03-16 14:56:46,518 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:46,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:46,549 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 655 statements into 1 equivalence classes.
[2025-03-16 14:56:46,571 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 655 of 655 statements.
[2025-03-16 14:56:46,571 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:46,571 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:46,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 753 backedges. 567 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked.
[2025-03-16 14:56:46,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:46,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769537923]
[2025-03-16 14:56:46,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769537923] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:46,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:46,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:46,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956778748]
[2025-03-16 14:56:46,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:46,777 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:46,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:46,778 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:46,778 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:46,778 INFO  L87              Difference]: Start difference. First operand 120914 states and 133210 transitions. Second operand  has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:49,851 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:49,851 INFO  L93              Difference]: Finished difference Result 319180 states and 351044 transitions.
[2025-03-16 14:56:49,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:49,851 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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 655
[2025-03-16 14:56:49,852 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:50,068 INFO  L225             Difference]: With dead ends: 319180
[2025-03-16 14:56:50,068 INFO  L226             Difference]: Without dead ends: 199018
[2025-03-16 14:56:50,105 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:50,105 INFO  L435           NwaCegarLoop]: 1319 mSDtfsCounter, 476 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:50,105 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1325 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-16 14:56:50,258 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 199018 states.
[2025-03-16 14:56:51,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 199018 to 177990.
[2025-03-16 14:56:51,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 177990 states, 177989 states have (on average 1.0839546264094972) internal successors, (192932), 177989 states have internal predecessors, (192932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:52,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 177990 states to 177990 states and 192932 transitions.
[2025-03-16 14:56:52,089 INFO  L78                 Accepts]: Start accepts. Automaton has 177990 states and 192932 transitions. Word has length 655
[2025-03-16 14:56:52,089 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:52,090 INFO  L471      AbstractCegarLoop]: Abstraction has 177990 states and 192932 transitions.
[2025-03-16 14:56:52,090 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:52,090 INFO  L276                IsEmpty]: Start isEmpty. Operand 177990 states and 192932 transitions.
[2025-03-16 14:56:52,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 772
[2025-03-16 14:56:52,120 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:52,120 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:52,120 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 14:56:52,120 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:52,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:52,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1783266628, now seen corresponding path program 1 times
[2025-03-16 14:56:52,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:52,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357160873]
[2025-03-16 14:56:52,121 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:52,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:52,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 771 statements into 1 equivalence classes.
[2025-03-16 14:56:52,182 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 771 of 771 statements.
[2025-03-16 14:56:52,182 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:52,182 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:52,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 851 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2025-03-16 14:56:52,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:52,716 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357160873]
[2025-03-16 14:56:52,716 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357160873] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:52,716 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:52,716 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:52,716 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728474145]
[2025-03-16 14:56:52,716 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:52,720 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:56:52,720 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:52,721 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:56:52,721 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:52,721 INFO  L87              Difference]: Start difference. First operand 177990 states and 192932 transitions. Second operand  has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:55,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:56:55,126 INFO  L93              Difference]: Finished difference Result 355228 states and 385107 transitions.
[2025-03-16 14:56:55,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:56:55,126 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 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 771
[2025-03-16 14:56:55,126 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:56:55,322 INFO  L225             Difference]: With dead ends: 355228
[2025-03-16 14:56:55,322 INFO  L226             Difference]: Without dead ends: 177990
[2025-03-16 14:56:55,419 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:56:55,419 INFO  L435           NwaCegarLoop]: 1253 mSDtfsCounter, 405 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-16 14:56:55,419 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1260 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-16 14:56:55,558 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 177990 states.
[2025-03-16 14:56:57,430 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 177990 to 173484.
[2025-03-16 14:56:57,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173484 states, 173483 states have (on average 1.059296876350997) internal successors, (183770), 173483 states have internal predecessors, (183770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:57,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173484 states to 173484 states and 183770 transitions.
[2025-03-16 14:56:57,655 INFO  L78                 Accepts]: Start accepts. Automaton has 173484 states and 183770 transitions. Word has length 771
[2025-03-16 14:56:57,655 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:56:57,655 INFO  L471      AbstractCegarLoop]: Abstraction has 173484 states and 183770 transitions.
[2025-03-16 14:56:57,656 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:56:57,656 INFO  L276                IsEmpty]: Start isEmpty. Operand 173484 states and 183770 transitions.
[2025-03-16 14:56:57,699 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 804
[2025-03-16 14:56:57,700 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:56:57,700 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:56:57,700 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 14:56:57,700 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:56:57,701 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:56:57,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 942875948, now seen corresponding path program 1 times
[2025-03-16 14:56:57,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:56:57,705 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827439316]
[2025-03-16 14:56:57,705 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:56:57,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:56:57,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes.
[2025-03-16 14:56:57,816 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements.
[2025-03-16 14:56:57,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:56:57,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:56:58,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 499 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked.
[2025-03-16 14:56:58,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:56:58,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827439316]
[2025-03-16 14:56:58,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827439316] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:56:58,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:56:58,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:56:58,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886470592]
[2025-03-16 14:56:58,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:56:58,736 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:56:58,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:56:58,737 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:56:58,737 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:56:58,737 INFO  L87              Difference]: Start difference. First operand 173484 states and 183770 transitions. Second operand  has 4 states, 4 states have (on average 136.0) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:57:02,623 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:57:02,623 INFO  L93              Difference]: Finished difference Result 343212 states and 364958 transitions.
[2025-03-16 14:57:02,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:57:02,624 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 136.0) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 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 803
[2025-03-16 14:57:02,624 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:57:02,862 INFO  L225             Difference]: With dead ends: 343212
[2025-03-16 14:57:02,862 INFO  L226             Difference]: Without dead ends: 199769
[2025-03-16 14:57:02,949 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:57:02,949 INFO  L435           NwaCegarLoop]: 44 mSDtfsCounter, 1552 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4519 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 4519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-03-16 14:57:02,950 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 57 Invalid, 5125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 4519 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-03-16 14:57:03,285 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 199769 states.
[2025-03-16 14:57:04,609 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 199769 to 175737.
[2025-03-16 14:57:04,695 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175737 states, 175736 states have (on average 1.0591227750716985) internal successors, (186126), 175736 states have internal predecessors, (186126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:57:04,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175737 states to 175737 states and 186126 transitions.
[2025-03-16 14:57:04,864 INFO  L78                 Accepts]: Start accepts. Automaton has 175737 states and 186126 transitions. Word has length 803
[2025-03-16 14:57:04,866 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:57:04,866 INFO  L471      AbstractCegarLoop]: Abstraction has 175737 states and 186126 transitions.
[2025-03-16 14:57:04,866 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 136.0) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:57:04,866 INFO  L276                IsEmpty]: Start isEmpty. Operand 175737 states and 186126 transitions.
[2025-03-16 14:57:04,898 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 857
[2025-03-16 14:57:04,902 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:57:04,902 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:57:04,902 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-16 14:57:04,902 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:57:04,902 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:57:04,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 310233034, now seen corresponding path program 1 times
[2025-03-16 14:57:04,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:57:04,903 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761743988]
[2025-03-16 14:57:04,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:57:04,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:57:04,954 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 856 statements into 1 equivalence classes.
[2025-03-16 14:57:04,969 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 856 of 856 statements.
[2025-03-16 14:57:04,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:57:04,970 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:57:06,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 1402 backedges. 1085 proven. 14 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked.
[2025-03-16 14:57:06,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:57:06,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761743988]
[2025-03-16 14:57:06,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761743988] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:57:06,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145179454]
[2025-03-16 14:57:06,116 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:57:06,116 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:57:06,116 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:57:06,118 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:57:06,119 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-16 14:57:06,185 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 856 statements into 1 equivalence classes.
[2025-03-16 14:57:06,298 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 856 of 856 statements.
[2025-03-16 14:57:06,298 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:57:06,298 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:57:06,302 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-03-16 14:57:06,310 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:57:07,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 1402 backedges. 983 proven. 108 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked.
[2025-03-16 14:57:07,967 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-16 14:57:10,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 1402 backedges. 1077 proven. 14 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked.
[2025-03-16 14:57:10,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145179454] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-16 14:57:10,028 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-16 14:57:10,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9
[2025-03-16 14:57:10,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082005885]
[2025-03-16 14:57:10,028 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-16 14:57:10,029 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-16 14:57:10,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:57:10,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-16 14:57:10,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-16 14:57:10,030 INFO  L87              Difference]: Start difference. First operand 175737 states and 186126 transitions. Second operand  has 10 states, 10 states have (on average 95.0) internal successors, (950), 9 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)