./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.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-29.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 2d1a08586e28489dc94d2285dea3402a5710056ff4819769698695dc05870e8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:56:46,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:56:46,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:56:46,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:56:46,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:56:46,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:56:46,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:56:46,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:56:46,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:56:46,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:56:46,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:56:46,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:56:46,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:56:46,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:56:46,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:56:46,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:56:46,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:56:46,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:56:46,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:56:46,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:56:46,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:56:46,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:56:46,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:56:46,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:56:46,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:56:46,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:56:46,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:56:46,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:56:46,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:56:46,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:56:46,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:56:46,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:56:46,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:56:46,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:56:46,945 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 -> 2d1a08586e28489dc94d2285dea3402a5710056ff4819769698695dc05870e8f [2025-03-08 10:56:47,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:56:47,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:56:47,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:56:47,166 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:56:47,166 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:56:47,168 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-29.i [2025-03-08 10:56:48,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4051838/8e013d74516f4df7becbfa87639edad7/FLAG7eec0620e [2025-03-08 10:56:48,559 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:56:48,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2025-03-08 10:56:48,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4051838/8e013d74516f4df7becbfa87639edad7/FLAG7eec0620e [2025-03-08 10:56:48,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4051838/8e013d74516f4df7becbfa87639edad7 [2025-03-08 10:56:48,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:56:48,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:56:48,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:56:48,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:56:48,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:56:48,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:48,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48, skipping insertion in model container [2025-03-08 10:56:48,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:48,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:56:48,702 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-29.i[916,929] [2025-03-08 10:56:48,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:56:48,831 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:56:48,839 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-29.i[916,929] [2025-03-08 10:56:48,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:56:48,911 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:56:48,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48 WrapperNode [2025-03-08 10:56:48,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:56:48,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:56:48,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:56:48,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:56:48,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:48,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:48,969 INFO L138 Inliner]: procedures = 26, calls = 89, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 550 [2025-03-08 10:56:48,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:56:48,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:56:48,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:56:48,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:56:48,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:48,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:48,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:49,020 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 10:56:49,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:49,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:49,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:49,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:49,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:49,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:49,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:56:49,053 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:56:49,053 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:56:49,053 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:56:49,054 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (1/1) ... [2025-03-08 10:56:49,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:56:49,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:56:49,075 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 10:56:49,080 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 10:56:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:56:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:56:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:56:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:56:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:56:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:56:49,178 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:56:49,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:56:49,803 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 10:56:49,803 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:56:49,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:56:49,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:56:49,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:56:49 BoogieIcfgContainer [2025-03-08 10:56:49,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:56:49,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:56:49,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:56:49,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:56:49,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:56:48" (1/3) ... [2025-03-08 10:56:49,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668d5d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:56:49, skipping insertion in model container [2025-03-08 10:56:49,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:48" (2/3) ... [2025-03-08 10:56:49,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668d5d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:56:49, skipping insertion in model container [2025-03-08 10:56:49,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:56:49" (3/3) ... [2025-03-08 10:56:49,838 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2025-03-08 10:56:49,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:56:49,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-29.i that has 2 procedures, 228 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:56:49,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:56:49,912 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;@4a6367bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:56:49,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:56:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 150 states have internal predecessors, (231), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 10:56:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:56:49,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:49,939 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:49,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:49,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2137676269, now seen corresponding path program 1 times [2025-03-08 10:56:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:49,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441019186] [2025-03-08 10:56:49,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:49,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:50,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:56:50,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:56:50,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:50,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-03-08 10:56:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:50,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441019186] [2025-03-08 10:56:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441019186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:56:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023762987] [2025-03-08 10:56:50,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:50,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:56:50,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:56:50,408 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 10:56:50,410 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 10:56:50,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:56:50,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:56:50,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:50,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:50,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:56:50,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:56:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-03-08 10:56:50,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:56:50,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023762987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:50,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:56:50,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:56:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740797635] [2025-03-08 10:56:50,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:50,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:56:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:50,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:56:50,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:56:50,752 INFO L87 Difference]: Start difference. First operand has 228 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 150 states have internal predecessors, (231), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 10:56:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:50,810 INFO L93 Difference]: Finished difference Result 450 states and 837 transitions. [2025-03-08 10:56:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:56:50,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) Word has length 471 [2025-03-08 10:56:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:50,820 INFO L225 Difference]: With dead ends: 450 [2025-03-08 10:56:50,820 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 10:56:50,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 472 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 10:56:50,826 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:50,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 10:56:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-08 10:56:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 147 states have (on average 1.530612244897959) internal successors, (225), 147 states have internal predecessors, (225), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 10:56:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 377 transitions. [2025-03-08 10:56:50,892 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 377 transitions. Word has length 471 [2025-03-08 10:56:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:50,893 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 377 transitions. [2025-03-08 10:56:50,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 10:56:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 377 transitions. [2025-03-08 10:56:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:56:50,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:50,905 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:50,913 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 10:56:51,106 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 10:56:51,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:51,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash -405518471, now seen corresponding path program 1 times [2025-03-08 10:56:51,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:51,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053348070] [2025-03-08 10:56:51,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:51,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:56:51,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:56:51,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:51,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:56:51,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:51,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053348070] [2025-03-08 10:56:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053348070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:51,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:51,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592905824] [2025-03-08 10:56:51,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:51,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:51,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:51,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:51,582 INFO L87 Difference]: Start difference. First operand 225 states and 377 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:56:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:51,678 INFO L93 Difference]: Finished difference Result 579 states and 974 transitions. [2025-03-08 10:56:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:51,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-08 10:56:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:51,684 INFO L225 Difference]: With dead ends: 579 [2025-03-08 10:56:51,686 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 10:56:51,687 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 10:56:51,688 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 229 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:51,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 794 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:56:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 10:56:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 354. [2025-03-08 10:56:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 245 states have (on average 1.5591836734693878) internal successors, (382), 246 states have internal predecessors, (382), 106 states have call successors, (106), 2 states have call predecessors, (106), 2 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 10:56:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 594 transitions. [2025-03-08 10:56:51,743 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 594 transitions. Word has length 471 [2025-03-08 10:56:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:51,745 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 594 transitions. [2025-03-08 10:56:51,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:56:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 594 transitions. [2025-03-08 10:56:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:56:51,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:51,752 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:51,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:56:51,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:51,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:51,754 INFO L85 PathProgramCache]: Analyzing trace with hash -281445224, now seen corresponding path program 1 times [2025-03-08 10:56:51,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:51,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736274126] [2025-03-08 10:56:51,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:51,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:56:51,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:56:51,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:51,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:56:52,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736274126] [2025-03-08 10:56:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736274126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:52,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:52,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:52,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581059436] [2025-03-08 10:56:52,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:52,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:52,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:52,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:52,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:52,061 INFO L87 Difference]: Start difference. First operand 354 states and 594 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:56:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:52,144 INFO L93 Difference]: Finished difference Result 716 states and 1198 transitions. [2025-03-08 10:56:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:52,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-08 10:56:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:52,150 INFO L225 Difference]: With dead ends: 716 [2025-03-08 10:56:52,150 INFO L226 Difference]: Without dead ends: 365 [2025-03-08 10:56:52,153 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 10:56:52,154 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 195 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:52,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 784 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:56:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-08 10:56:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 296. [2025-03-08 10:56:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 10:56:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2025-03-08 10:56:52,187 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 471 [2025-03-08 10:56:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:52,190 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2025-03-08 10:56:52,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:56:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2025-03-08 10:56:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:56:52,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:52,196 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:52,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:56:52,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:52,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1071864473, now seen corresponding path program 1 times [2025-03-08 10:56:52,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:52,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721780917] [2025-03-08 10:56:52,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:52,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:56:52,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:56:52,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:52,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:56:52,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:52,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721780917] [2025-03-08 10:56:52,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721780917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:52,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:52,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:56:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696159527] [2025-03-08 10:56:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:52,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:56:52,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:52,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:56:52,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:56:52,747 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 10:56:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:54,378 INFO L93 Difference]: Finished difference Result 1421 states and 2361 transitions. [2025-03-08 10:56:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:56:54,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 471 [2025-03-08 10:56:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:54,385 INFO L225 Difference]: With dead ends: 1421 [2025-03-08 10:56:54,385 INFO L226 Difference]: Without dead ends: 1128 [2025-03-08 10:56:54,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:56:54,387 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1622 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:54,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 1964 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 10:56:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-03-08 10:56:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 982. [2025-03-08 10:56:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 725 states have (on average 1.56) internal successors, (1131), 727 states have internal predecessors, (1131), 247 states have call successors, (247), 9 states have call predecessors, (247), 9 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) [2025-03-08 10:56:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1625 transitions. [2025-03-08 10:56:54,491 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1625 transitions. Word has length 471 [2025-03-08 10:56:54,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:54,492 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1625 transitions. [2025-03-08 10:56:54,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 10:56:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1625 transitions. [2025-03-08 10:56:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:56:54,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:54,497 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:54,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:56:54,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:54,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash 227392602, now seen corresponding path program 1 times [2025-03-08 10:56:54,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197646955] [2025-03-08 10:56:54,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:54,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:54,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:56:54,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:56:54,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:56:54,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197646955] [2025-03-08 10:56:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197646955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:54,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:54,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:54,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314385] [2025-03-08 10:56:54,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:54,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:54,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:54,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:54,878 INFO L87 Difference]: Start difference. First operand 982 states and 1625 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:56:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:54,983 INFO L93 Difference]: Finished difference Result 2940 states and 4869 transitions. [2025-03-08 10:56:54,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:54,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-08 10:56:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:54,994 INFO L225 Difference]: With dead ends: 2940 [2025-03-08 10:56:54,995 INFO L226 Difference]: Without dead ends: 1961 [2025-03-08 10:56:54,998 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 10:56:55,000 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 214 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:55,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 721 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-08 10:56:55,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1959. [2025-03-08 10:56:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1446 states have (on average 1.5587828492392808) internal successors, (2254), 1450 states have internal predecessors, (2254), 494 states have call successors, (494), 18 states have call predecessors, (494), 18 states have return successors, (494), 490 states have call predecessors, (494), 494 states have call successors, (494) [2025-03-08 10:56:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 3242 transitions. [2025-03-08 10:56:55,127 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 3242 transitions. Word has length 471 [2025-03-08 10:56:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:55,127 INFO L471 AbstractCegarLoop]: Abstraction has 1959 states and 3242 transitions. [2025-03-08 10:56:55,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:56:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3242 transitions. [2025-03-08 10:56:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:56:55,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:55,131 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:55,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:56:55,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:55,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash 256021753, now seen corresponding path program 1 times [2025-03-08 10:56:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:55,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347904694] [2025-03-08 10:56:55,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:55,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:56:55,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:56:55,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:55,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:56:55,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:55,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347904694] [2025-03-08 10:56:55,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347904694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:55,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:55,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:56:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364716846] [2025-03-08 10:56:55,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:55,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:56:55,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:55,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:56:55,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:56:55,494 INFO L87 Difference]: Start difference. First operand 1959 states and 3242 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:56:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:56,783 INFO L93 Difference]: Finished difference Result 7551 states and 12413 transitions. [2025-03-08 10:56:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:56:56,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-08 10:56:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:56,810 INFO L225 Difference]: With dead ends: 7551 [2025-03-08 10:56:56,810 INFO L226 Difference]: Without dead ends: 5595 [2025-03-08 10:56:56,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:56:56,818 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 941 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:56,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1958 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 10:56:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2025-03-08 10:56:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 5199. [2025-03-08 10:56:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5199 states, 3986 states have (on average 1.5689914701455092) internal successors, (6254), 4006 states have internal predecessors, (6254), 1150 states have call successors, (1150), 62 states have call predecessors, (1150), 62 states have return successors, (1150), 1130 states have call predecessors, (1150), 1150 states have call successors, (1150) [2025-03-08 10:56:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 8554 transitions. [2025-03-08 10:56:57,107 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 8554 transitions. Word has length 471 [2025-03-08 10:56:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:57,108 INFO L471 AbstractCegarLoop]: Abstraction has 5199 states and 8554 transitions. [2025-03-08 10:56:57,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:56:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 8554 transitions. [2025-03-08 10:56:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:56:57,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:57,113 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:57,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:56:57,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:57,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash -937562665, now seen corresponding path program 1 times [2025-03-08 10:56:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:57,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57686206] [2025-03-08 10:56:57,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:57,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:57,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:56:57,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:56:57,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:57,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:56:57,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:57,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57686206] [2025-03-08 10:56:57,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57686206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:57,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:57,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:56:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544010130] [2025-03-08 10:56:57,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:57,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:56:57,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:57,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:56:57,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:56:57,404 INFO L87 Difference]: Start difference. First operand 5199 states and 8554 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 10:56:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:58,727 INFO L93 Difference]: Finished difference Result 13574 states and 22261 transitions. [2025-03-08 10:56:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:56:58,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 471 [2025-03-08 10:56:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:58,768 INFO L225 Difference]: With dead ends: 13574 [2025-03-08 10:56:58,769 INFO L226 Difference]: Without dead ends: 8378 [2025-03-08 10:56:58,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:56:58,784 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1267 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:58,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 1430 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 10:56:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8378 states. [2025-03-08 10:56:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8378 to 8297. [2025-03-08 10:56:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8297 states, 6224 states have (on average 1.544987146529563) internal successors, (9616), 6259 states have internal predecessors, (9616), 1962 states have call successors, (1962), 110 states have call predecessors, (1962), 110 states have return successors, (1962), 1927 states have call predecessors, (1962), 1962 states have call successors, (1962) [2025-03-08 10:56:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 13540 transitions. [2025-03-08 10:56:59,299 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 13540 transitions. Word has length 471 [2025-03-08 10:56:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:59,301 INFO L471 AbstractCegarLoop]: Abstraction has 8297 states and 13540 transitions. [2025-03-08 10:56:59,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 10:56:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 13540 transitions. [2025-03-08 10:56:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:56:59,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:59,306 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:59,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:56:59,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:59,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1782034536, now seen corresponding path program 1 times [2025-03-08 10:56:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120726467] [2025-03-08 10:56:59,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:59,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:56:59,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:56:59,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:59,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:56:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120726467] [2025-03-08 10:56:59,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120726467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:59,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:59,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56795943] [2025-03-08 10:56:59,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:59,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:59,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:59,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:59,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:59,642 INFO L87 Difference]: Start difference. First operand 8297 states and 13540 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:56:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:59,974 INFO L93 Difference]: Finished difference Result 16573 states and 27081 transitions. [2025-03-08 10:56:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-08 10:56:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:00,024 INFO L225 Difference]: With dead ends: 16573 [2025-03-08 10:57:00,025 INFO L226 Difference]: Without dead ends: 8369 [2025-03-08 10:57:00,047 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 10:57:00,047 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:00,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 723 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2025-03-08 10:57:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 8369. [2025-03-08 10:57:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8369 states, 6296 states have (on average 1.5387547649301143) internal successors, (9688), 6331 states have internal predecessors, (9688), 1962 states have call successors, (1962), 110 states have call predecessors, (1962), 110 states have return successors, (1962), 1927 states have call predecessors, (1962), 1962 states have call successors, (1962) [2025-03-08 10:57:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 13612 transitions. [2025-03-08 10:57:00,478 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 13612 transitions. Word has length 471 [2025-03-08 10:57:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:00,479 INFO L471 AbstractCegarLoop]: Abstraction has 8369 states and 13612 transitions. [2025-03-08 10:57:00,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:57:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 13612 transitions. [2025-03-08 10:57:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:57:00,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:00,491 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:00,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:57:00,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:00,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash 435723417, now seen corresponding path program 1 times [2025-03-08 10:57:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377685252] [2025-03-08 10:57:00,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:00,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:57:00,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:57:00,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:00,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:57:00,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:00,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377685252] [2025-03-08 10:57:00,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377685252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:00,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:00,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:57:00,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843685329] [2025-03-08 10:57:00,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:00,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:57:00,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:00,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:57:00,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:57:00,814 INFO L87 Difference]: Start difference. First operand 8369 states and 13612 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:57:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:02,030 INFO L93 Difference]: Finished difference Result 26651 states and 43345 transitions. [2025-03-08 10:57:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:57:02,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-08 10:57:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:02,102 INFO L225 Difference]: With dead ends: 26651 [2025-03-08 10:57:02,102 INFO L226 Difference]: Without dead ends: 18375 [2025-03-08 10:57:02,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 10:57:02,125 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 605 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:02,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1309 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:57:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18375 states. [2025-03-08 10:57:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18375 to 16579. [2025-03-08 10:57:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16579 states, 12484 states have (on average 1.525472604934316) internal successors, (19044), 12553 states have internal predecessors, (19044), 3872 states have call successors, (3872), 222 states have call predecessors, (3872), 222 states have return successors, (3872), 3803 states have call predecessors, (3872), 3872 states have call successors, (3872) [2025-03-08 10:57:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16579 states to 16579 states and 26788 transitions. [2025-03-08 10:57:02,965 INFO L78 Accepts]: Start accepts. Automaton has 16579 states and 26788 transitions. Word has length 471 [2025-03-08 10:57:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:02,965 INFO L471 AbstractCegarLoop]: Abstraction has 16579 states and 26788 transitions. [2025-03-08 10:57:02,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:57:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 16579 states and 26788 transitions. [2025-03-08 10:57:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:57:02,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:02,972 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:02,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:57:02,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:02,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash 647074330, now seen corresponding path program 1 times [2025-03-08 10:57:02,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:02,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394856874] [2025-03-08 10:57:02,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:02,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:57:03,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:57:03,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:03,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:57:04,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:04,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394856874] [2025-03-08 10:57:04,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394856874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:04,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:04,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:57:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301836529] [2025-03-08 10:57:04,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:04,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:57:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:04,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:57:04,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:57:04,380 INFO L87 Difference]: Start difference. First operand 16579 states and 26788 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:57:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:18,976 INFO L93 Difference]: Finished difference Result 93211 states and 148981 transitions. [2025-03-08 10:57:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 10:57:18,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-08 10:57:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:19,258 INFO L225 Difference]: With dead ends: 93211 [2025-03-08 10:57:19,259 INFO L226 Difference]: Without dead ends: 76245 [2025-03-08 10:57:19,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2025-03-08 10:57:19,312 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 5527 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 3748 mSolverCounterSat, 3720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5527 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 7468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3720 IncrementalHoareTripleChecker+Valid, 3748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:19,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5527 Valid, 3672 Invalid, 7468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3720 Valid, 3748 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-03-08 10:57:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76245 states. [2025-03-08 10:57:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76245 to 37801. [2025-03-08 10:57:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37801 states, 28280 states have (on average 1.520862800565771) internal successors, (43010), 28449 states have internal predecessors, (43010), 9004 states have call successors, (9004), 516 states have call predecessors, (9004), 516 states have return successors, (9004), 8835 states have call predecessors, (9004), 9004 states have call successors, (9004) [2025-03-08 10:57:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37801 states to 37801 states and 61018 transitions. [2025-03-08 10:57:22,946 INFO L78 Accepts]: Start accepts. Automaton has 37801 states and 61018 transitions. Word has length 471 [2025-03-08 10:57:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:22,947 INFO L471 AbstractCegarLoop]: Abstraction has 37801 states and 61018 transitions. [2025-03-08 10:57:22,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:57:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 37801 states and 61018 transitions. [2025-03-08 10:57:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 10:57:22,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:22,960 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:22,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:57:22,960 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:22,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash -648222660, now seen corresponding path program 1 times [2025-03-08 10:57:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214467649] [2025-03-08 10:57:22,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:22,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:57:23,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:57:23,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:23,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 69 proven. 156 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-03-08 10:57:23,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214467649] [2025-03-08 10:57:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214467649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385554075] [2025-03-08 10:57:23,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:23,442 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 10:57:23,444 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 10:57:23,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 10:57:23,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 10:57:23,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:23,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:23,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 10:57:23,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6693 proven. 102 refuted. 0 times theorem prover too weak. 4605 trivial. 0 not checked. [2025-03-08 10:57:24,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:57:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 123 proven. 102 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-03-08 10:57:24,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385554075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:57:24,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:57:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-03-08 10:57:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682178842] [2025-03-08 10:57:24,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:57:24,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 10:57:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:24,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 10:57:24,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-08 10:57:24,993 INFO L87 Difference]: Start difference. First operand 37801 states and 61018 transitions. Second operand has 21 states, 20 states have (on average 11.05) internal successors, (221), 21 states have internal predecessors, (221), 8 states have call successors, (178), 3 states have call predecessors, (178), 5 states have return successors, (179), 7 states have call predecessors, (179), 8 states have call successors, (179) [2025-03-08 10:57:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:42,830 INFO L93 Difference]: Finished difference Result 184890 states and 289337 transitions. [2025-03-08 10:57:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-08 10:57:42,831 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 11.05) internal successors, (221), 21 states have internal predecessors, (221), 8 states have call successors, (178), 3 states have call predecessors, (178), 5 states have return successors, (179), 7 states have call predecessors, (179), 8 states have call successors, (179) Word has length 471 [2025-03-08 10:57:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:43,413 INFO L225 Difference]: With dead ends: 184890 [2025-03-08 10:57:43,413 INFO L226 Difference]: Without dead ends: 146902 [2025-03-08 10:57:43,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1090 GetRequests, 941 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9024 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4021, Invalid=18629, Unknown=0, NotChecked=0, Total=22650 [2025-03-08 10:57:43,535 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 5950 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 4003 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5950 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 7731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:43,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5950 Valid, 2601 Invalid, 7731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4003 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-08 10:57:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146902 states. [2025-03-08 10:57:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146902 to 80145. [2025-03-08 10:57:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80145 states, 63881 states have (on average 1.5377968410012366) internal successors, (98236), 64148 states have internal predecessors, (98236), 14894 states have call successors, (14894), 1369 states have call predecessors, (14894), 1369 states have return successors, (14894), 14627 states have call predecessors, (14894), 14894 states have call successors, (14894) [2025-03-08 10:57:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80145 states to 80145 states and 128024 transitions. [2025-03-08 10:57:51,202 INFO L78 Accepts]: Start accepts. Automaton has 80145 states and 128024 transitions. Word has length 471 [2025-03-08 10:57:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:51,203 INFO L471 AbstractCegarLoop]: Abstraction has 80145 states and 128024 transitions. [2025-03-08 10:57:51,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 11.05) internal successors, (221), 21 states have internal predecessors, (221), 8 states have call successors, (178), 3 states have call predecessors, (178), 5 states have return successors, (179), 7 states have call predecessors, (179), 8 states have call successors, (179) [2025-03-08 10:57:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 80145 states and 128024 transitions. [2025-03-08 10:57:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-08 10:57:51,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:51,220 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:51,229 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 10:57:51,421 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,SelfDestructingSolverStorable10 [2025-03-08 10:57:51,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:51,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:51,423 INFO L85 PathProgramCache]: Analyzing trace with hash -159724448, now seen corresponding path program 1 times [2025-03-08 10:57:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:51,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568029268] [2025-03-08 10:57:51,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:51,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:51,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 10:57:51,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 10:57:51,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:51,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 123 proven. 102 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-03-08 10:57:51,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:51,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568029268] [2025-03-08 10:57:51,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568029268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:51,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434951012] [2025-03-08 10:57:51,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:51,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:51,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:51,882 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 10:57:51,884 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 10:57:51,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 10:57:52,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 10:57:52,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:52,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:52,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 10:57:52,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6021 proven. 192 refuted. 0 times theorem prover too weak. 5187 trivial. 0 not checked. [2025-03-08 10:57:52,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:57:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 252 proven. 195 refuted. 0 times theorem prover too weak. 10953 trivial. 0 not checked. [2025-03-08 10:57:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434951012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:57:53,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:57:53,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-03-08 10:57:53,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863042349] [2025-03-08 10:57:53,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:57:53,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 10:57:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:53,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 10:57:53,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-03-08 10:57:53,271 INFO L87 Difference]: Start difference. First operand 80145 states and 128024 transitions. Second operand has 21 states, 21 states have (on average 9.333333333333334) internal successors, (196), 21 states have internal predecessors, (196), 7 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187) [2025-03-08 10:57:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:59,436 INFO L93 Difference]: Finished difference Result 136643 states and 216819 transitions. [2025-03-08 10:57:59,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 10:57:59,437 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.333333333333334) internal successors, (196), 21 states have internal predecessors, (196), 7 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187) Word has length 472 [2025-03-08 10:57:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:59,669 INFO L225 Difference]: With dead ends: 136643 [2025-03-08 10:57:59,670 INFO L226 Difference]: Without dead ends: 66323 [2025-03-08 10:57:59,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 936 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=644, Invalid=2436, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 10:57:59,799 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 3521 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 4025 mSolverCounterSat, 1608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3564 SdHoareTripleChecker+Valid, 4020 SdHoareTripleChecker+Invalid, 5633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1608 IncrementalHoareTripleChecker+Valid, 4025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:59,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3564 Valid, 4020 Invalid, 5633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1608 Valid, 4025 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 10:57:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66323 states. [2025-03-08 10:58:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66323 to 52111. [2025-03-08 10:58:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52111 states, 42354 states have (on average 1.5501251357604948) internal successors, (65654), 42479 states have internal predecessors, (65654), 8909 states have call successors, (8909), 847 states have call predecessors, (8909), 847 states have return successors, (8909), 8784 states have call predecessors, (8909), 8909 states have call successors, (8909) [2025-03-08 10:58:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52111 states to 52111 states and 83472 transitions. [2025-03-08 10:58:03,555 INFO L78 Accepts]: Start accepts. Automaton has 52111 states and 83472 transitions. Word has length 472 [2025-03-08 10:58:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 52111 states and 83472 transitions. [2025-03-08 10:58:03,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.333333333333334) internal successors, (196), 21 states have internal predecessors, (196), 7 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187) [2025-03-08 10:58:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 52111 states and 83472 transitions. [2025-03-08 10:58:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-08 10:58:03,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:03,565 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:03,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 10:58:03,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:03,767 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:03,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash 785907903, now seen corresponding path program 1 times [2025-03-08 10:58:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:03,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319860157] [2025-03-08 10:58:03,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:03,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 10:58:03,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 10:58:03,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:03,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 10:58:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319860157] [2025-03-08 10:58:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319860157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:58:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024670324] [2025-03-08 10:58:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:04,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:58:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:04,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:58:04,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:58:04,051 INFO L87 Difference]: Start difference. First operand 52111 states and 83472 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 10:58:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:08,988 INFO L93 Difference]: Finished difference Result 120765 states and 193343 transitions. [2025-03-08 10:58:08,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:58:08,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 472 [2025-03-08 10:58:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:09,172 INFO L225 Difference]: With dead ends: 120765 [2025-03-08 10:58:09,172 INFO L226 Difference]: Without dead ends: 68757 [2025-03-08 10:58:09,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:58:09,260 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1348 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:09,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1728 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 10:58:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68757 states.