./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i -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 5d61e8fa49d21946be87d65ea6f560fd70d33fb1241a73bd802d2afa2c954396
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 11:01:47,354 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 11:01:47,423 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 11:01:47,430 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 11:01:47,431 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 11:01:47,452 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 11:01:47,452 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 11:01:47,452 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 11:01:47,453 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 11:01:47,453 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 11:01:47,453 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 11:01:47,453 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 11:01:47,454 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 11:01:47,454 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 11:01:47,454 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 11:01:47,454 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 11:01:47,455 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 11:01:47,456 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 11:01:47,456 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 11:01:47,456 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 11:01:47,456 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 -> 5d61e8fa49d21946be87d65ea6f560fd70d33fb1241a73bd802d2afa2c954396
[2025-03-08 11:01:47,714 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 11:01:47,724 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 11:01:47,726 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 11:01:47,728 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 11:01:47,728 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 11:01:47,730 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i
[2025-03-08 11:01:49,072 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cdad48a/f16801e73ac942109165a3d8788042f8/FLAG7af3aec9c
[2025-03-08 11:01:49,331 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 11:01:49,331 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i
[2025-03-08 11:01:49,343 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cdad48a/f16801e73ac942109165a3d8788042f8/FLAG7af3aec9c
[2025-03-08 11:01:49,358 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cdad48a/f16801e73ac942109165a3d8788042f8
[2025-03-08 11:01:49,360 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 11:01:49,362 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 11:01:49,363 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 11:01:49,363 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 11:01:49,366 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 11:01:49,367 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,367 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b533ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49, skipping insertion in model container
[2025-03-08 11:01:49,368 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,391 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 11:01:49,537 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i[916,929]
[2025-03-08 11:01:49,665 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:01:49,683 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 11:01:49,692 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-72.i[916,929]
[2025-03-08 11:01:49,764 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:01:49,784 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 11:01:49,785 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49 WrapperNode
[2025-03-08 11:01:49,786 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 11:01:49,787 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 11:01:49,787 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 11:01:49,788 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 11:01:49,792 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,804 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,874 INFO  L138                Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505
[2025-03-08 11:01:49,874 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 11:01:49,875 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 11:01:49,875 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 11:01:49,875 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 11:01:49,886 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,886 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,893 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,916 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-08 11:01:49,916 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,917 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,930 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,933 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,938 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,942 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,952 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 11:01:49,953 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 11:01:49,953 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 11:01:49,953 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 11:01:49,954 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (1/1) ...
[2025-03-08 11:01:49,959 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 11:01:49,972 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:01:49,989 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-08 11:01:49,992 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-08 11:01:50,009 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 11:01:50,009 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 11:01:50,009 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 11:01:50,009 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 11:01:50,010 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 11:01:50,010 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 11:01:50,120 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 11:01:50,122 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 11:01:50,925 INFO  L?                        ?]: Removed 10 outVars from TransFormulas that were not future-live.
[2025-03-08 11:01:50,926 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 11:01:50,955 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 11:01:50,955 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 11:01:50,956 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:01:50 BoogieIcfgContainer
[2025-03-08 11:01:50,956 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 11:01:50,958 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 11:01:50,958 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 11:01:50,962 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 11:01:50,963 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:01:49" (1/3) ...
[2025-03-08 11:01:50,963 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376da11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:01:50, skipping insertion in model container
[2025-03-08 11:01:50,963 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:49" (2/3) ...
[2025-03-08 11:01:50,964 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376da11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:01:50, skipping insertion in model container
[2025-03-08 11:01:50,964 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:01:50" (3/3) ...
[2025-03-08 11:01:50,965 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-72.i
[2025-03-08 11:01:50,979 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 11:01:50,982 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-72.i that has 2 procedures, 211 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 11:01:51,040 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 11:01:51,054 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;@1db5eaf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 11:01:51,054 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 11:01:51,061 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 211 states, 141 states have (on average 1.5602836879432624) internal successors, (220), 142 states have internal predecessors, (220), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67)
[2025-03-08 11:01:51,086 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 429
[2025-03-08 11:01:51,089 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:51,090 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:51,091 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:51,096 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:51,097 INFO  L85        PathProgramCache]: Analyzing trace with hash 129389065, now seen corresponding path program 1 times
[2025-03-08 11:01:51,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:51,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653435420]
[2025-03-08 11:01:51,107 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:51,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:01:51,259 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes.
[2025-03-08 11:01:51,302 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements.
[2025-03-08 11:01:51,306 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:51,306 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:51,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked.
[2025-03-08 11:01:51,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:01:51,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653435420]
[2025-03-08 11:01:51,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653435420] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:01:51,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986551149]
[2025-03-08 11:01:51,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:51,611 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:01:51,611 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:01:51,613 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-08 11:01:51,615 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-08 11:01:51,720 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes.
[2025-03-08 11:01:51,845 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements.
[2025-03-08 11:01:51,847 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:51,847 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:51,852 INFO  L256         TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 11:01:51,879 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 11:01:51,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked.
[2025-03-08 11:01:51,947 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 11:01:51,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986551149] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:01:51,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 11:01:51,948 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 11:01:51,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61369243]
[2025-03-08 11:01:51,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:01:51,954 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 11:01:51,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:01:51,973 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 11:01:51,974 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 11:01:51,976 INFO  L87              Difference]: Start difference. First operand  has 211 states, 141 states have (on average 1.5602836879432624) internal successors, (220), 142 states have internal predecessors, (220), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand  has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 11:01:52,046 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:01:52,047 INFO  L93              Difference]: Finished difference Result 416 states and 770 transitions.
[2025-03-08 11:01:52,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 11:01:52,049 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 428
[2025-03-08 11:01:52,050 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:01:52,058 INFO  L225             Difference]: With dead ends: 416
[2025-03-08 11:01:52,059 INFO  L226             Difference]: Without dead ends: 208
[2025-03-08 11:01:52,068 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 429 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-08 11:01:52,072 INFO  L435           NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:01:52,072 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:01:52,094 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2025-03-08 11:01:52,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208.
[2025-03-08 11:01:52,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 208 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67)
[2025-03-08 11:01:52,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 349 transitions.
[2025-03-08 11:01:52,152 INFO  L78                 Accepts]: Start accepts. Automaton has 208 states and 349 transitions. Word has length 428
[2025-03-08 11:01:52,153 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:01:52,154 INFO  L471      AbstractCegarLoop]: Abstraction has 208 states and 349 transitions.
[2025-03-08 11:01:52,154 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 11:01:52,155 INFO  L276                IsEmpty]: Start isEmpty. Operand 208 states and 349 transitions.
[2025-03-08 11:01:52,163 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 429
[2025-03-08 11:01:52,165 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:52,166 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:52,174 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-08 11:01:52,372 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,SelfDestructingSolverStorable0
[2025-03-08 11:01:52,376 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:52,377 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:52,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068698842, now seen corresponding path program 1 times
[2025-03-08 11:01:52,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:52,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212238059]
[2025-03-08 11:01:52,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:52,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:01:52,434 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes.
[2025-03-08 11:01:52,531 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements.
[2025-03-08 11:01:52,531 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:52,532 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:52,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:01:52,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:01:52,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212238059]
[2025-03-08 11:01:52,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212238059] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:01:52,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:01:52,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:01:52,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388993411]
[2025-03-08 11:01:52,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:01:52,903 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:01:52,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:01:52,904 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:01:52,904 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:01:52,905 INFO  L87              Difference]: Start difference. First operand 208 states and 349 transitions. Second operand  has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:52,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:01:52,984 INFO  L93              Difference]: Finished difference Result 532 states and 898 transitions.
[2025-03-08 11:01:52,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:01:52,985 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 428
[2025-03-08 11:01:52,986 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:01:52,989 INFO  L225             Difference]: With dead ends: 532
[2025-03-08 11:01:52,990 INFO  L226             Difference]: Without dead ends: 327
[2025-03-08 11:01:52,991 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-08 11:01:52,991 INFO  L435           NwaCegarLoop]: 498 mSDtfsCounter, 200 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:01:52,992 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 822 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:01:52,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 327 states.
[2025-03-08 11:01:53,027 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324.
[2025-03-08 11:01:53,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 324 states, 237 states have (on average 1.6033755274261603) internal successors, (380), 238 states have internal predecessors, (380), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84)
[2025-03-08 11:01:53,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 548 transitions.
[2025-03-08 11:01:53,032 INFO  L78                 Accepts]: Start accepts. Automaton has 324 states and 548 transitions. Word has length 428
[2025-03-08 11:01:53,033 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:01:53,033 INFO  L471      AbstractCegarLoop]: Abstraction has 324 states and 548 transitions.
[2025-03-08 11:01:53,034 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:53,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 324 states and 548 transitions.
[2025-03-08 11:01:53,040 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 430
[2025-03-08 11:01:53,040 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:53,040 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:53,041 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 11:01:53,041 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:53,041 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:53,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -567231751, now seen corresponding path program 1 times
[2025-03-08 11:01:53,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:53,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396567167]
[2025-03-08 11:01:53,042 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:53,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:01:53,088 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes.
[2025-03-08 11:01:53,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements.
[2025-03-08 11:01:53,168 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:53,168 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:53,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:01:53,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:01:53,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396567167]
[2025-03-08 11:01:53,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396567167] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:01:53,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:01:53,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:01:53,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77394643]
[2025-03-08 11:01:53,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:01:53,380 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:01:53,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:01:53,381 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:01:53,381 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:01:53,382 INFO  L87              Difference]: Start difference. First operand 324 states and 548 transitions. Second operand  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:53,472 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:01:53,473 INFO  L93              Difference]: Finished difference Result 850 states and 1425 transitions.
[2025-03-08 11:01:53,473 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:01:53,474 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 429
[2025-03-08 11:01:53,474 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:01:53,482 INFO  L225             Difference]: With dead ends: 850
[2025-03-08 11:01:53,483 INFO  L226             Difference]: Without dead ends: 529
[2025-03-08 11:01:53,485 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-08 11:01:53,486 INFO  L435           NwaCegarLoop]: 533 mSDtfsCounter, 229 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:01:53,487 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 864 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:01:53,488 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 529 states.
[2025-03-08 11:01:53,538 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 326.
[2025-03-08 11:01:53,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 326 states, 239 states have (on average 1.598326359832636) internal successors, (382), 240 states have internal predecessors, (382), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84)
[2025-03-08 11:01:53,543 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 550 transitions.
[2025-03-08 11:01:53,545 INFO  L78                 Accepts]: Start accepts. Automaton has 326 states and 550 transitions. Word has length 429
[2025-03-08 11:01:53,547 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:01:53,548 INFO  L471      AbstractCegarLoop]: Abstraction has 326 states and 550 transitions.
[2025-03-08 11:01:53,548 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:53,548 INFO  L276                IsEmpty]: Start isEmpty. Operand 326 states and 550 transitions.
[2025-03-08 11:01:53,554 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 430
[2025-03-08 11:01:53,554 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:53,555 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:53,555 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 11:01:53,555 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:53,556 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:53,556 INFO  L85        PathProgramCache]: Analyzing trace with hash -1920541448, now seen corresponding path program 1 times
[2025-03-08 11:01:53,556 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:53,556 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827563853]
[2025-03-08 11:01:53,556 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:53,556 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:01:53,585 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes.
[2025-03-08 11:01:53,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements.
[2025-03-08 11:01:53,651 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:53,651 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:54,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:01:54,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:01:54,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827563853]
[2025-03-08 11:01:54,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827563853] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:01:54,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:01:54,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:01:54,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861769545]
[2025-03-08 11:01:54,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:01:54,029 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:01:54,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:01:54,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:01:54,031 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:01:54,031 INFO  L87              Difference]: Start difference. First operand 326 states and 550 transitions. Second operand  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:54,107 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:01:54,107 INFO  L93              Difference]: Finished difference Result 681 states and 1142 transitions.
[2025-03-08 11:01:54,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:01:54,108 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 429
[2025-03-08 11:01:54,109 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:01:54,111 INFO  L225             Difference]: With dead ends: 681
[2025-03-08 11:01:54,111 INFO  L226             Difference]: Without dead ends: 358
[2025-03-08 11:01:54,115 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 11:01:54,116 INFO  L435           NwaCegarLoop]: 351 mSDtfsCounter, 18 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:01:54,117 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 679 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:01:54,117 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 358 states.
[2025-03-08 11:01:54,147 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 334.
[2025-03-08 11:01:54,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 334 states, 247 states have (on average 1.5951417004048583) internal successors, (394), 248 states have internal predecessors, (394), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84)
[2025-03-08 11:01:54,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 562 transitions.
[2025-03-08 11:01:54,153 INFO  L78                 Accepts]: Start accepts. Automaton has 334 states and 562 transitions. Word has length 429
[2025-03-08 11:01:54,154 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:01:54,154 INFO  L471      AbstractCegarLoop]: Abstraction has 334 states and 562 transitions.
[2025-03-08 11:01:54,154 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:54,155 INFO  L276                IsEmpty]: Start isEmpty. Operand 334 states and 562 transitions.
[2025-03-08 11:01:54,161 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 431
[2025-03-08 11:01:54,161 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:54,162 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:54,162 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 11:01:54,162 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:54,162 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:54,162 INFO  L85        PathProgramCache]: Analyzing trace with hash 1056579403, now seen corresponding path program 1 times
[2025-03-08 11:01:54,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:54,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152140278]
[2025-03-08 11:01:54,163 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:54,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:01:54,192 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes.
[2025-03-08 11:01:54,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements.
[2025-03-08 11:01:54,226 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:54,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:54,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:01:54,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:01:54,487 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152140278]
[2025-03-08 11:01:54,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152140278] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:01:54,487 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:01:54,487 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:01:54,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390543580]
[2025-03-08 11:01:54,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:01:54,488 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:01:54,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:01:54,489 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:01:54,490 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:01:54,490 INFO  L87              Difference]: Start difference. First operand 334 states and 562 transitions. Second operand  has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 11:01:54,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:01:54,893 INFO  L93              Difference]: Finished difference Result 988 states and 1668 transitions.
[2025-03-08 11:01:54,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:01:54,894 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 430
[2025-03-08 11:01:54,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:01:54,900 INFO  L225             Difference]: With dead ends: 988
[2025-03-08 11:01:54,900 INFO  L226             Difference]: Without dead ends: 657
[2025-03-08 11:01:54,902 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 11:01:54,902 INFO  L435           NwaCegarLoop]: 333 mSDtfsCounter, 547 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 11:01:54,903 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 658 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 11:01:54,907 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 657 states.
[2025-03-08 11:01:54,951 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 334.
[2025-03-08 11:01:54,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 334 states, 247 states have (on average 1.5951417004048583) internal successors, (394), 248 states have internal predecessors, (394), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84)
[2025-03-08 11:01:54,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 562 transitions.
[2025-03-08 11:01:54,959 INFO  L78                 Accepts]: Start accepts. Automaton has 334 states and 562 transitions. Word has length 430
[2025-03-08 11:01:54,960 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:01:54,960 INFO  L471      AbstractCegarLoop]: Abstraction has 334 states and 562 transitions.
[2025-03-08 11:01:54,960 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67)
[2025-03-08 11:01:54,960 INFO  L276                IsEmpty]: Start isEmpty. Operand 334 states and 562 transitions.
[2025-03-08 11:01:54,972 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 431
[2025-03-08 11:01:54,972 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:54,972 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:54,973 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 11:01:54,973 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:54,973 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:54,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -1904974291, now seen corresponding path program 1 times
[2025-03-08 11:01:54,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:54,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415926678]
[2025-03-08 11:01:54,973 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:54,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:01:55,017 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes.
[2025-03-08 11:01:55,077 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements.
[2025-03-08 11:01:55,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:55,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:55,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:01:55,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:01:55,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415926678]
[2025-03-08 11:01:55,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415926678] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:01:55,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:01:55,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:01:55,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27395628]
[2025-03-08 11:01:55,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:01:55,369 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:01:55,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:01:55,370 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:01:55,370 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:01:55,371 INFO  L87              Difference]: Start difference. First operand 334 states and 562 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:55,450 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:01:55,451 INFO  L93              Difference]: Finished difference Result 996 states and 1680 transitions.
[2025-03-08 11:01:55,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:01:55,451 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430
[2025-03-08 11:01:55,452 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:01:55,461 INFO  L225             Difference]: With dead ends: 996
[2025-03-08 11:01:55,461 INFO  L226             Difference]: Without dead ends: 665
[2025-03-08 11:01:55,462 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 11:01:55,463 INFO  L435           NwaCegarLoop]: 591 mSDtfsCounter, 341 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:01:55,463 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 925 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:01:55,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 665 states.
[2025-03-08 11:01:55,524 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663.
[2025-03-08 11:01:55,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 663 states, 490 states have (on average 1.5959183673469388) internal successors, (782), 492 states have internal predecessors, (782), 168 states have call successors, (168), 4 states have call predecessors, (168), 4 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168)
[2025-03-08 11:01:55,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1118 transitions.
[2025-03-08 11:01:55,532 INFO  L78                 Accepts]: Start accepts. Automaton has 663 states and 1118 transitions. Word has length 430
[2025-03-08 11:01:55,532 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:01:55,532 INFO  L471      AbstractCegarLoop]: Abstraction has 663 states and 1118 transitions.
[2025-03-08 11:01:55,533 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:55,533 INFO  L276                IsEmpty]: Start isEmpty. Operand 663 states and 1118 transitions.
[2025-03-08 11:01:55,539 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 431
[2025-03-08 11:01:55,540 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:55,540 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:55,540 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 11:01:55,540 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:55,541 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:55,541 INFO  L85        PathProgramCache]: Analyzing trace with hash 206316078, now seen corresponding path program 1 times
[2025-03-08 11:01:55,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:55,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694668513]
[2025-03-08 11:01:55,541 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:55,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:01:55,572 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes.
[2025-03-08 11:01:55,629 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements.
[2025-03-08 11:01:55,629 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:55,629 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:56,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:01:56,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:01:56,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694668513]
[2025-03-08 11:01:56,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694668513] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:01:56,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:01:56,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 11:01:56,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453323997]
[2025-03-08 11:01:56,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:01:56,069 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 11:01:56,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:01:56,070 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 11:01:56,070 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:01:56,070 INFO  L87              Difference]: Start difference. First operand 663 states and 1118 transitions. Second operand  has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:56,749 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:01:56,750 INFO  L93              Difference]: Finished difference Result 1985 states and 3349 transitions.
[2025-03-08 11:01:56,750 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:01:56,750 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430
[2025-03-08 11:01:56,751 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:01:56,767 INFO  L225             Difference]: With dead ends: 1985
[2025-03-08 11:01:56,767 INFO  L226             Difference]: Without dead ends: 1325
[2025-03-08 11:01:56,773 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:01:56,774 INFO  L435           NwaCegarLoop]: 588 mSDtfsCounter, 755 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 11:01:56,774 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1109 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 11:01:56,775 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1325 states.
[2025-03-08 11:01:56,917 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1301.
[2025-03-08 11:01:56,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1301 states, 956 states have (on average 1.5878661087866108) internal successors, (1518), 960 states have internal predecessors, (1518), 336 states have call successors, (336), 8 states have call predecessors, (336), 8 states have return successors, (336), 332 states have call predecessors, (336), 336 states have call successors, (336)
[2025-03-08 11:01:56,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2190 transitions.
[2025-03-08 11:01:56,939 INFO  L78                 Accepts]: Start accepts. Automaton has 1301 states and 2190 transitions. Word has length 430
[2025-03-08 11:01:56,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:01:56,943 INFO  L471      AbstractCegarLoop]: Abstraction has 1301 states and 2190 transitions.
[2025-03-08 11:01:56,943 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:56,943 INFO  L276                IsEmpty]: Start isEmpty. Operand 1301 states and 2190 transitions.
[2025-03-08 11:01:56,952 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 431
[2025-03-08 11:01:56,952 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:56,957 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:56,957 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 11:01:56,957 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:56,957 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:56,958 INFO  L85        PathProgramCache]: Analyzing trace with hash 237335885, now seen corresponding path program 1 times
[2025-03-08 11:01:56,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:56,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293087273]
[2025-03-08 11:01:56,958 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:56,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:01:56,990 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes.
[2025-03-08 11:01:57,101 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements.
[2025-03-08 11:01:57,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:57,102 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:57,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:01:57,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:01:57,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293087273]
[2025-03-08 11:01:57,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293087273] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:01:57,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:01:57,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:01:57,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836752525]
[2025-03-08 11:01:57,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:01:57,376 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:01:57,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:01:57,376 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:01:57,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:01:57,377 INFO  L87              Difference]: Start difference. First operand 1301 states and 2190 transitions. Second operand  has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:57,920 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:01:57,921 INFO  L93              Difference]: Finished difference Result 6493 states and 10938 transitions.
[2025-03-08 11:01:57,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 11:01:57,924 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430
[2025-03-08 11:01:57,925 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:01:57,958 INFO  L225             Difference]: With dead ends: 6493
[2025-03-08 11:01:57,958 INFO  L226             Difference]: Without dead ends: 5195
[2025-03-08 11:01:57,966 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 11:01:57,967 INFO  L435           NwaCegarLoop]: 624 mSDtfsCounter, 787 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 11:01:57,967 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1617 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 11:01:57,973 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5195 states.
[2025-03-08 11:01:58,374 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5195 to 5173.
[2025-03-08 11:01:58,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5173 states, 3796 states have (on average 1.58377239199157) internal successors, (6012), 3812 states have internal predecessors, (6012), 1344 states have call successors, (1344), 32 states have call predecessors, (1344), 32 states have return successors, (1344), 1328 states have call predecessors, (1344), 1344 states have call successors, (1344)
[2025-03-08 11:01:58,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 8700 transitions.
[2025-03-08 11:01:58,430 INFO  L78                 Accepts]: Start accepts. Automaton has 5173 states and 8700 transitions. Word has length 430
[2025-03-08 11:01:58,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:01:58,431 INFO  L471      AbstractCegarLoop]: Abstraction has 5173 states and 8700 transitions.
[2025-03-08 11:01:58,432 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:58,433 INFO  L276                IsEmpty]: Start isEmpty. Operand 5173 states and 8700 transitions.
[2025-03-08 11:01:58,438 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 431
[2025-03-08 11:01:58,438 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:58,438 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:58,439 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 11:01:58,439 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:58,439 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:58,440 INFO  L85        PathProgramCache]: Analyzing trace with hash -1772767956, now seen corresponding path program 1 times
[2025-03-08 11:01:58,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:58,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806680820]
[2025-03-08 11:01:58,440 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:58,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:01:58,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes.
[2025-03-08 11:01:58,499 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements.
[2025-03-08 11:01:58,499 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:01:58,499 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:01:58,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:01:58,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:01:58,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806680820]
[2025-03-08 11:01:58,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806680820] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:01:58,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:01:58,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:01:58,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746958916]
[2025-03-08 11:01:58,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:01:58,613 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:01:58,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:01:58,615 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:01:58,615 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:01:58,616 INFO  L87              Difference]: Start difference. First operand 5173 states and 8700 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:59,136 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:01:59,137 INFO  L93              Difference]: Finished difference Result 13945 states and 23298 transitions.
[2025-03-08 11:01:59,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:01:59,138 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430
[2025-03-08 11:01:59,138 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:01:59,197 INFO  L225             Difference]: With dead ends: 13945
[2025-03-08 11:01:59,197 INFO  L226             Difference]: Without dead ends: 8775
[2025-03-08 11:01:59,218 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-08 11:01:59,220 INFO  L435           NwaCegarLoop]: 449 mSDtfsCounter, 224 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:01:59,221 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 778 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:01:59,229 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8775 states.
[2025-03-08 11:01:59,859 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8775 to 8437.
[2025-03-08 11:01:59,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8437 states, 6084 states have (on average 1.5450361604207759) internal successors, (9400), 6132 states have internal predecessors, (9400), 2288 states have call successors, (2288), 64 states have call predecessors, (2288), 64 states have return successors, (2288), 2240 states have call predecessors, (2288), 2288 states have call successors, (2288)
[2025-03-08 11:01:59,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13976 transitions.
[2025-03-08 11:01:59,958 INFO  L78                 Accepts]: Start accepts. Automaton has 8437 states and 13976 transitions. Word has length 430
[2025-03-08 11:01:59,960 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:01:59,960 INFO  L471      AbstractCegarLoop]: Abstraction has 8437 states and 13976 transitions.
[2025-03-08 11:01:59,960 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:01:59,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 8437 states and 13976 transitions.
[2025-03-08 11:01:59,968 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 431
[2025-03-08 11:01:59,968 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:01:59,968 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:01:59,968 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 11:01:59,968 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:01:59,974 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:01:59,974 INFO  L85        PathProgramCache]: Analyzing trace with hash 2073502701, now seen corresponding path program 1 times
[2025-03-08 11:01:59,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:01:59,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341286631]
[2025-03-08 11:01:59,974 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:01:59,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:02:00,032 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes.
[2025-03-08 11:02:00,068 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements.
[2025-03-08 11:02:00,069 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:02:00,069 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:02:00,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:02:00,180 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:02:00,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341286631]
[2025-03-08 11:02:00,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341286631] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:02:00,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:02:00,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:02:00,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60510930]
[2025-03-08 11:02:00,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:02:00,181 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:02:00,181 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:02:00,182 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:02:00,182 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:02:00,185 INFO  L87              Difference]: Start difference. First operand 8437 states and 13976 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:02:00,492 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:02:00,492 INFO  L93              Difference]: Finished difference Result 15601 states and 25878 transitions.
[2025-03-08 11:02:00,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:02:00,493 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430
[2025-03-08 11:02:00,494 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:02:00,552 INFO  L225             Difference]: With dead ends: 15601
[2025-03-08 11:02:00,553 INFO  L226             Difference]: Without dead ends: 7167
[2025-03-08 11:02:00,622 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-08 11:02:00,622 INFO  L435           NwaCegarLoop]: 422 mSDtfsCounter, 217 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:02:00,623 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 749 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:02:00,627 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7167 states.
[2025-03-08 11:02:00,922 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7167 to 5813.
[2025-03-08 11:02:00,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5813 states, 4420 states have (on average 1.5873303167420814) internal successors, (7016), 4436 states have internal predecessors, (7016), 1344 states have call successors, (1344), 48 states have call predecessors, (1344), 48 states have return successors, (1344), 1328 states have call predecessors, (1344), 1344 states have call successors, (1344)
[2025-03-08 11:02:00,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5813 states to 5813 states and 9704 transitions.
[2025-03-08 11:02:00,961 INFO  L78                 Accepts]: Start accepts. Automaton has 5813 states and 9704 transitions. Word has length 430
[2025-03-08 11:02:00,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:02:00,961 INFO  L471      AbstractCegarLoop]: Abstraction has 5813 states and 9704 transitions.
[2025-03-08 11:02:00,962 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:02:00,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 5813 states and 9704 transitions.
[2025-03-08 11:02:00,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 431
[2025-03-08 11:02:00,966 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:02:00,966 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:00,966 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 11:02:00,967 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:02:00,967 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:02:00,967 INFO  L85        PathProgramCache]: Analyzing trace with hash -976700114, now seen corresponding path program 1 times
[2025-03-08 11:02:00,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:02:00,967 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762089452]
[2025-03-08 11:02:00,968 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:02:00,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:02:00,989 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes.
[2025-03-08 11:02:01,040 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements.
[2025-03-08 11:02:01,041 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:02:01,041 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:02:01,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:02:01,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:02:01,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762089452]
[2025-03-08 11:02:01,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762089452] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:02:01,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:02:01,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:02:01,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541106573]
[2025-03-08 11:02:01,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:02:01,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:02:01,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:02:01,355 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:02:01,355 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:02:01,355 INFO  L87              Difference]: Start difference. First operand 5813 states and 9704 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:02:01,744 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:02:01,744 INFO  L93              Difference]: Finished difference Result 13257 states and 22148 transitions.
[2025-03-08 11:02:01,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:02:01,745 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 430
[2025-03-08 11:02:01,746 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:02:01,776 INFO  L225             Difference]: With dead ends: 13257
[2025-03-08 11:02:01,776 INFO  L226             Difference]: Without dead ends: 7447
[2025-03-08 11:02:01,795 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 11:02:01,795 INFO  L435           NwaCegarLoop]: 406 mSDtfsCounter, 199 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:02:01,795 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 735 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:02:01,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7447 states.
[2025-03-08 11:02:02,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7447 to 4509.
[2025-03-08 11:02:02,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4509 states, 3464 states have (on average 1.5941108545034641) internal successors, (5522), 3476 states have internal predecessors, (5522), 1008 states have call successors, (1008), 36 states have call predecessors, (1008), 36 states have return successors, (1008), 996 states have call predecessors, (1008), 1008 states have call successors, (1008)
[2025-03-08 11:02:02,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 7538 transitions.
[2025-03-08 11:02:02,136 INFO  L78                 Accepts]: Start accepts. Automaton has 4509 states and 7538 transitions. Word has length 430
[2025-03-08 11:02:02,136 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:02:02,137 INFO  L471      AbstractCegarLoop]: Abstraction has 4509 states and 7538 transitions.
[2025-03-08 11:02:02,137 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:02:02,137 INFO  L276                IsEmpty]: Start isEmpty. Operand 4509 states and 7538 transitions.
[2025-03-08 11:02:02,141 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 11:02:02,141 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:02:02,141 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:02,142 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 11:02:02,142 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:02:02,142 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:02:02,142 INFO  L85        PathProgramCache]: Analyzing trace with hash 1868748613, now seen corresponding path program 1 times
[2025-03-08 11:02:02,142 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:02:02,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846157152]
[2025-03-08 11:02:02,142 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:02:02,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:02:02,160 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 11:02:02,286 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 11:02:02,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:02:02,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:02:02,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:02:02,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:02:02,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846157152]
[2025-03-08 11:02:02,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846157152] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:02:02,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:02:02,613 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:02:02,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451868222]
[2025-03-08 11:02:02,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:02:02,614 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:02:02,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:02:02,614 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:02:02,614 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:02:02,614 INFO  L87              Difference]: Start difference. First operand 4509 states and 7538 transitions. Second operand  has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:02:03,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:02:03,327 INFO  L93              Difference]: Finished difference Result 13579 states and 22599 transitions.
[2025-03-08 11:02:03,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:02:03,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 431
[2025-03-08 11:02:03,329 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:02:03,364 INFO  L225             Difference]: With dead ends: 13579
[2025-03-08 11:02:03,364 INFO  L226             Difference]: Without dead ends: 9073
[2025-03-08 11:02:03,380 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:02:03,381 INFO  L435           NwaCegarLoop]: 652 mSDtfsCounter, 374 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 11:02:03,382 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1478 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 11:02:03,390 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9073 states.
[2025-03-08 11:02:03,880 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 6032.
[2025-03-08 11:02:03,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6032 states, 4269 states have (on average 1.5045678144764583) internal successors, (6423), 4305 states have internal predecessors, (6423), 1679 states have call successors, (1679), 83 states have call predecessors, (1679), 83 states have return successors, (1679), 1643 states have call predecessors, (1679), 1679 states have call successors, (1679)
[2025-03-08 11:02:03,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 9781 transitions.
[2025-03-08 11:02:03,921 INFO  L78                 Accepts]: Start accepts. Automaton has 6032 states and 9781 transitions. Word has length 431
[2025-03-08 11:02:03,922 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:02:03,922 INFO  L471      AbstractCegarLoop]: Abstraction has 6032 states and 9781 transitions.
[2025-03-08 11:02:03,923 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:02:03,923 INFO  L276                IsEmpty]: Start isEmpty. Operand 6032 states and 9781 transitions.
[2025-03-08 11:02:03,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 11:02:03,927 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:02:03,927 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:03,928 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 11:02:03,928 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:02:03,929 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:02:03,929 INFO  L85        PathProgramCache]: Analyzing trace with hash -683408348, now seen corresponding path program 1 times
[2025-03-08 11:02:03,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:02:03,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845711948]
[2025-03-08 11:02:03,929 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:02:03,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:02:03,951 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 11:02:04,000 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 11:02:04,000 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:02:04,001 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:02:06,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:02:06,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:02:06,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845711948]
[2025-03-08 11:02:06,540 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845711948] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:02:06,540 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:02:06,540 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 11:02:06,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041690443]
[2025-03-08 11:02:06,541 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:02:06,541 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 11:02:06,541 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:02:06,542 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 11:02:06,542 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 11:02:06,542 INFO  L87              Difference]: Start difference. First operand 6032 states and 9781 transitions. Second operand  has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:02:08,372 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:02:08,373 INFO  L93              Difference]: Finished difference Result 21681 states and 35082 transitions.
[2025-03-08 11:02:08,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 11:02:08,373 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 431
[2025-03-08 11:02:08,374 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:02:08,451 INFO  L225             Difference]: With dead ends: 21681
[2025-03-08 11:02:08,452 INFO  L226             Difference]: Without dead ends: 15652
[2025-03-08 11:02:08,474 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-08 11:02:08,474 INFO  L435           NwaCegarLoop]: 411 mSDtfsCounter, 442 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 11:02:08,475 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1467 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 11:02:08,488 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15652 states.
[2025-03-08 11:02:09,629 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15652 to 15602.
[2025-03-08 11:02:09,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15602 states, 11422 states have (on average 1.5132201015583961) internal successors, (17284), 11554 states have internal predecessors, (17284), 3954 states have call successors, (3954), 225 states have call predecessors, (3954), 225 states have return successors, (3954), 3822 states have call predecessors, (3954), 3954 states have call successors, (3954)
[2025-03-08 11:02:09,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15602 states to 15602 states and 25192 transitions.
[2025-03-08 11:02:09,739 INFO  L78                 Accepts]: Start accepts. Automaton has 15602 states and 25192 transitions. Word has length 431
[2025-03-08 11:02:09,739 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:02:09,740 INFO  L471      AbstractCegarLoop]: Abstraction has 15602 states and 25192 transitions.
[2025-03-08 11:02:09,740 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)
[2025-03-08 11:02:09,740 INFO  L276                IsEmpty]: Start isEmpty. Operand 15602 states and 25192 transitions.
[2025-03-08 11:02:09,752 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 11:02:09,752 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:02:09,752 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:09,752 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 11:02:09,752 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:02:09,753 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:02:09,754 INFO  L85        PathProgramCache]: Analyzing trace with hash 933280900, now seen corresponding path program 1 times
[2025-03-08 11:02:09,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:02:09,754 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020513670]
[2025-03-08 11:02:09,754 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:02:09,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:02:09,779 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 11:02:09,921 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 11:02:09,921 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:02:09,921 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:02:11,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked.
[2025-03-08 11:02:11,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:02:11,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020513670]
[2025-03-08 11:02:11,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020513670] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:02:12,000 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:02:12,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 11:02:12,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753274398]
[2025-03-08 11:02:12,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:02:12,000 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 11:02:12,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:02:12,001 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 11:02:12,001 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-03-08 11:02:12,001 INFO  L87              Difference]: Start difference. First operand 15602 states and 25192 transitions. Second operand  has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67)
[2025-03-08 11:02:30,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:02:30,547 INFO  L93              Difference]: Finished difference Result 123723 states and 197088 transitions.
[2025-03-08 11:02:30,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-03-08 11:02:30,547 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 431
[2025-03-08 11:02:30,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:02:31,012 INFO  L225             Difference]: With dead ends: 123723
[2025-03-08 11:02:31,013 INFO  L226             Difference]: Without dead ends: 118165
[2025-03-08 11:02:31,064 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650
[2025-03-08 11:02:31,065 INFO  L435           NwaCegarLoop]: 885 mSDtfsCounter, 4160 mSDsluCounter, 2681 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 2033 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4160 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 4326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2033 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time
[2025-03-08 11:02:31,065 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4160 Valid, 3566 Invalid, 4326 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2033 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time]
[2025-03-08 11:02:31,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118165 states.
[2025-03-08 11:02:39,625 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118165 to 77842.
[2025-03-08 11:02:39,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 77842 states, 56883 states have (on average 1.5001845894203891) internal successors, (85335), 57652 states have internal predecessors, (85335), 19739 states have call successors, (19739), 1219 states have call predecessors, (19739), 1219 states have return successors, (19739), 18970 states have call predecessors, (19739), 19739 states have call successors, (19739)
[2025-03-08 11:02:39,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77842 states to 77842 states and 124813 transitions.
[2025-03-08 11:02:40,052 INFO  L78                 Accepts]: Start accepts. Automaton has 77842 states and 124813 transitions. Word has length 431
[2025-03-08 11:02:40,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:02:40,053 INFO  L471      AbstractCegarLoop]: Abstraction has 77842 states and 124813 transitions.
[2025-03-08 11:02:40,053 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67)
[2025-03-08 11:02:40,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 77842 states and 124813 transitions.
[2025-03-08 11:02:40,077 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-08 11:02:40,077 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:02:40,077 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:40,078 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 11:02:40,078 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:02:40,078 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:02:40,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 1144631813, now seen corresponding path program 1 times
[2025-03-08 11:02:40,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:02:40,078 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974790664]
[2025-03-08 11:02:40,078 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:02:40,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:02:40,096 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 11:02:40,223 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 11:02:40,224 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:02:40,224 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:02:40,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 15 proven. 183 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked.
[2025-03-08 11:02:40,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:02:40,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974790664]
[2025-03-08 11:02:40,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974790664] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:02:40,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488240510]
[2025-03-08 11:02:40,406 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:02:40,406 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:02:40,406 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:02:40,409 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-08 11:02:40,411 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-08 11:02:40,514 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-08 11:02:40,594 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-08 11:02:40,594 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:02:40,594 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:02:40,598 INFO  L256         TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 11:02:40,608 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 11:02:41,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 4216 proven. 123 refuted. 0 times theorem prover too weak. 4505 trivial. 0 not checked.
[2025-03-08 11:02:41,193 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 11:02:41,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 75 proven. 123 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked.
[2025-03-08 11:02:41,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488240510] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 11:02:41,804 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 11:02:41,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9
[2025-03-08 11:02:41,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107508631]
[2025-03-08 11:02:41,809 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 11:02:41,811 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 11:02:41,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:02:41,811 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 11:02:41,811 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-03-08 11:02:41,812 INFO  L87              Difference]: Start difference. First operand 77842 states and 124813 transitions. Second operand  has 9 states, 9 states have (on average 26.333333333333332) internal successors, (237), 9 states have internal predecessors, (237), 4 states have call successors, (169), 2 states have call predecessors, (169), 4 states have return successors, (171), 4 states have call predecessors, (171), 4 states have call successors, (171)
[2025-03-08 11:02:47,766 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:02:47,766 INFO  L93              Difference]: Finished difference Result 137806 states and 220709 transitions.
[2025-03-08 11:02:47,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 11:02:47,767 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 26.333333333333332) internal successors, (237), 9 states have internal predecessors, (237), 4 states have call successors, (169), 2 states have call predecessors, (169), 4 states have return successors, (171), 4 states have call predecessors, (171), 4 states have call successors, (171) Word has length 431
[2025-03-08 11:02:47,768 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:02:48,006 INFO  L225             Difference]: With dead ends: 137806
[2025-03-08 11:02:48,007 INFO  L226             Difference]: Without dead ends: 60008
[2025-03-08 11:02:48,142 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 859 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272
[2025-03-08 11:02:48,143 INFO  L435           NwaCegarLoop]: 268 mSDtfsCounter, 612 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 11:02:48,144 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 667 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 11:02:48,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60008 states.
[2025-03-08 11:02:53,402 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60008 to 59118.
[2025-03-08 11:02:53,452 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59118 states, 47302 states have (on average 1.519808887573464) internal successors, (71890), 47675 states have internal predecessors, (71890), 10451 states have call successors, (10451), 1364 states have call predecessors, (10451), 1364 states have return successors, (10451), 10078 states have call predecessors, (10451), 10451 states have call successors, (10451)
[2025-03-08 11:02:53,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59118 states to 59118 states and 92792 transitions.
[2025-03-08 11:02:53,665 INFO  L78                 Accepts]: Start accepts. Automaton has 59118 states and 92792 transitions. Word has length 431
[2025-03-08 11:02:53,666 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:02:53,666 INFO  L471      AbstractCegarLoop]: Abstraction has 59118 states and 92792 transitions.
[2025-03-08 11:02:53,666 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 26.333333333333332) internal successors, (237), 9 states have internal predecessors, (237), 4 states have call successors, (169), 2 states have call predecessors, (169), 4 states have return successors, (171), 4 states have call predecessors, (171), 4 states have call successors, (171)
[2025-03-08 11:02:53,666 INFO  L276                IsEmpty]: Start isEmpty. Operand 59118 states and 92792 transitions.
[2025-03-08 11:02:53,690 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 434
[2025-03-08 11:02:53,690 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:02:53,691 INFO  L218           NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:53,699 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-08 11:02:53,891 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,SelfDestructingSolverStorable14
[2025-03-08 11:02:53,891 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:02:53,893 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:02:53,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 299194324, now seen corresponding path program 1 times
[2025-03-08 11:02:53,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:02:53,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666024466]
[2025-03-08 11:02:53,894 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:02:53,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:02:53,916 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes.
[2025-03-08 11:02:54,013 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements.
[2025-03-08 11:02:54,013 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:02:54,013 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:02:54,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 102 proven. 96 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked.
[2025-03-08 11:02:54,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:02:54,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666024466]
[2025-03-08 11:02:54,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666024466] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:02:54,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386914092]
[2025-03-08 11:02:54,239 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:02:54,239 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:02:54,239 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:02:54,241 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-08 11:02:54,244 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-08 11:02:54,364 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes.
[2025-03-08 11:02:54,461 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements.
[2025-03-08 11:02:54,462 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:02:54,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:02:54,465 INFO  L256         TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 11:02:54,471 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 11:02:54,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 4108 proven. 69 refuted. 0 times theorem prover too weak. 4667 trivial. 0 not checked.
[2025-03-08 11:02:54,712 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 11:02:54,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 8844 backedges. 129 proven. 69 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked.
[2025-03-08 11:02:54,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [386914092] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 11:02:54,999 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 11:02:54,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8
[2025-03-08 11:02:54,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403999946]
[2025-03-08 11:02:54,999 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 11:02:55,000 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 11:02:55,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:02:55,000 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 11:02:55,000 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 11:02:55,001 INFO  L87              Difference]: Start difference. First operand 59118 states and 92792 transitions. Second operand  has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124)
[2025-03-08 11:02:58,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:02:58,918 INFO  L93              Difference]: Finished difference Result 93802 states and 145639 transitions.
[2025-03-08 11:02:58,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-08 11:02:58,918 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) Word has length 433
[2025-03-08 11:02:58,919 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:02:59,059 INFO  L225             Difference]: With dead ends: 93802
[2025-03-08 11:02:59,060 INFO  L226             Difference]: Without dead ends: 34732
[2025-03-08 11:02:59,159 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 863 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306
[2025-03-08 11:02:59,161 INFO  L435           NwaCegarLoop]: 311 mSDtfsCounter, 575 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 11:02:59,161 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 783 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 11:02:59,185 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34732 states.