./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22f39f2d47020c6c74bd46a8e88abd85ecc8d2cba04a8c3eaf7d602b79a3fb5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:39:52,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:39:53,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:39:53,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:39:53,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:39:53,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:39:53,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:39:53,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:39:53,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:39:53,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:39:53,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:39:53,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:39:53,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:39:53,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:39:53,036 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:39:53,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:39:53,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:39:53,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:39:53,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:39:53,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:39:53,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:39:53,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:39:53,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:39:53,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:39:53,039 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:39:53,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:39:53,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:39:53,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:39:53,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:39:53,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:39:53,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:39:53,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:39:53,039 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22f39f2d47020c6c74bd46a8e88abd85ecc8d2cba04a8c3eaf7d602b79a3fb5b [2025-02-06 02:39:53,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:39:53,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:39:53,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:39:53,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:39:53,302 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:39:53,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i [2025-02-06 02:39:54,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78642075c/f53a512a76e64e549795340778bbeb6e/FLAGf31a5ef54 [2025-02-06 02:39:54,947 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:39:54,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i [2025-02-06 02:39:54,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78642075c/f53a512a76e64e549795340778bbeb6e/FLAGf31a5ef54 [2025-02-06 02:39:54,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78642075c/f53a512a76e64e549795340778bbeb6e [2025-02-06 02:39:54,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:39:54,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:39:54,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:39:54,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:39:54,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:39:54,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:39:54" (1/1) ... [2025-02-06 02:39:54,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ddd863d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:54, skipping insertion in model container [2025-02-06 02:39:54,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:39:54" (1/1) ... [2025-02-06 02:39:55,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:39:55,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i[916,929] [2025-02-06 02:39:55,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:39:55,374 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:39:55,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i[916,929] [2025-02-06 02:39:55,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:39:55,517 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:39:55,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55 WrapperNode [2025-02-06 02:39:55,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:39:55,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:39:55,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:39:55,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:39:55,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,654 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 664 [2025-02-06 02:39:55,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:39:55,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:39:55,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:39:55,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:39:55,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,788 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-02-06 02:39:55,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:39:55,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:39:55,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:39:55,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:39:55,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (1/1) ... [2025-02-06 02:39:55,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:39:55,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:55,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:39:55,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:39:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:39:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:39:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:39:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:39:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:39:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:39:56,014 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:39:56,015 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:39:56,921 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short54#1;havoc property_#t~bitwise55#1;havoc property_#t~short56#1;havoc property_#t~bitwise57#1;havoc property_#t~short58#1; [2025-02-06 02:39:57,051 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-02-06 02:39:57,052 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:39:57,094 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:39:57,096 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:39:57,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:39:57 BoogieIcfgContainer [2025-02-06 02:39:57,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:39:57,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:39:57,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:39:57,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:39:57,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:39:54" (1/3) ... [2025-02-06 02:39:57,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46466be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:39:57, skipping insertion in model container [2025-02-06 02:39:57,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:55" (2/3) ... [2025-02-06 02:39:57,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46466be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:39:57, skipping insertion in model container [2025-02-06 02:39:57,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:39:57" (3/3) ... [2025-02-06 02:39:57,107 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-38.i [2025-02-06 02:39:57,118 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:39:57,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-38.i that has 2 procedures, 271 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:39:57,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:39:57,187 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;@659ffc51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:39:57,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:39:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 197 states have (on average 1.5380710659898478) internal successors, (303), 198 states have internal predecessors, (303), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:39:57,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-06 02:39:57,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:57,223 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:57,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:57,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash -338676512, now seen corresponding path program 1 times [2025-02-06 02:39:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887938907] [2025-02-06 02:39:57,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:57,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-06 02:39:57,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-06 02:39:57,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:57,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-06 02:39:57,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:57,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887938907] [2025-02-06 02:39:57,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887938907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809356604] [2025-02-06 02:39:57,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:57,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:57,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:57,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:39:57,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:39:57,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-06 02:39:58,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-06 02:39:58,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:58,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:58,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:39:58,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-06 02:39:58,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:39:58,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809356604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:58,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:39:58,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:39:58,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865333467] [2025-02-06 02:39:58,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:58,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:39:58,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:58,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:39:58,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:39:58,265 INFO L87 Difference]: Start difference. First operand has 271 states, 197 states have (on average 1.5380710659898478) internal successors, (303), 198 states have internal predecessors, (303), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-06 02:39:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:58,325 INFO L93 Difference]: Finished difference Result 536 states and 956 transitions. [2025-02-06 02:39:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:39:58,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 483 [2025-02-06 02:39:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:58,346 INFO L225 Difference]: With dead ends: 536 [2025-02-06 02:39:58,346 INFO L226 Difference]: Without dead ends: 268 [2025-02-06 02:39:58,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 484 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-02-06 02:39:58,354 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:58,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:39:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-06 02:39:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-02-06 02:39:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 195 states have (on average 1.5179487179487179) internal successors, (296), 195 states have internal predecessors, (296), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:39:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 438 transitions. [2025-02-06 02:39:58,417 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 438 transitions. Word has length 483 [2025-02-06 02:39:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:58,418 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 438 transitions. [2025-02-06 02:39:58,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-06 02:39:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 438 transitions. [2025-02-06 02:39:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-06 02:39:58,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:58,427 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:58,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:39:58,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:39:58,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:58,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1736119287, now seen corresponding path program 1 times [2025-02-06 02:39:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588233126] [2025-02-06 02:39:58,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:58,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-06 02:39:58,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-06 02:39:58,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:58,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:39:59,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:59,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588233126] [2025-02-06 02:39:59,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588233126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:59,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:59,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321270156] [2025-02-06 02:39:59,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:59,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:59,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:59,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:59,188 INFO L87 Difference]: Start difference. First operand 268 states and 438 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:59,333 INFO L93 Difference]: Finished difference Result 788 states and 1289 transitions. [2025-02-06 02:39:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:59,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-02-06 02:39:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:59,337 INFO L225 Difference]: With dead ends: 788 [2025-02-06 02:39:59,337 INFO L226 Difference]: Without dead ends: 523 [2025-02-06 02:39:59,338 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-02-06 02:39:59,338 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 405 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:59,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1060 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-02-06 02:39:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 322. [2025-02-06 02:39:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-06 02:39:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 523 transitions. [2025-02-06 02:39:59,375 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 523 transitions. Word has length 483 [2025-02-06 02:39:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:59,376 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 523 transitions. [2025-02-06 02:39:59,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 523 transitions. [2025-02-06 02:39:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-06 02:39:59,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:59,381 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:59,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:39:59,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:59,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash 995249867, now seen corresponding path program 1 times [2025-02-06 02:39:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:59,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863585001] [2025-02-06 02:39:59,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:59,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-06 02:39:59,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-06 02:39:59,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:59,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:39:59,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863585001] [2025-02-06 02:39:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863585001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:59,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:59,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:59,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700228042] [2025-02-06 02:39:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:59,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:59,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:59,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:59,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:59,682 INFO L87 Difference]: Start difference. First operand 322 states and 523 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:59,797 INFO L93 Difference]: Finished difference Result 880 states and 1431 transitions. [2025-02-06 02:39:59,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:59,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-02-06 02:39:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:59,804 INFO L225 Difference]: With dead ends: 880 [2025-02-06 02:39:59,804 INFO L226 Difference]: Without dead ends: 561 [2025-02-06 02:39:59,805 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-02-06 02:39:59,805 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 306 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:59,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 825 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-02-06 02:39:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 558. [2025-02-06 02:39:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 446 states have (on average 1.5336322869955157) internal successors, (684), 447 states have internal predecessors, (684), 109 states have call successors, (109), 2 states have call predecessors, (109), 2 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-06 02:39:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 902 transitions. [2025-02-06 02:39:59,854 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 902 transitions. Word has length 483 [2025-02-06 02:39:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:59,855 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 902 transitions. [2025-02-06 02:39:59,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:39:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 902 transitions. [2025-02-06 02:39:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-06 02:39:59,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:59,867 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:59,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:39:59,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:59,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash 124963499, now seen corresponding path program 1 times [2025-02-06 02:39:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:59,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867458470] [2025-02-06 02:39:59,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:59,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-06 02:40:00,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-06 02:40:00,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:00,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:00,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867458470] [2025-02-06 02:40:00,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867458470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:00,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630621886] [2025-02-06 02:40:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:00,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:00,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:00,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:00,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:00,301 INFO L87 Difference]: Start difference. First operand 558 states and 902 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:00,437 INFO L93 Difference]: Finished difference Result 1450 states and 2338 transitions. [2025-02-06 02:40:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-02-06 02:40:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:00,447 INFO L225 Difference]: With dead ends: 1450 [2025-02-06 02:40:00,447 INFO L226 Difference]: Without dead ends: 895 [2025-02-06 02:40:00,450 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-02-06 02:40:00,450 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 374 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:00,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 805 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-02-06 02:40:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 558. [2025-02-06 02:40:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 446 states have (on average 1.493273542600897) internal successors, (666), 447 states have internal predecessors, (666), 109 states have call successors, (109), 2 states have call predecessors, (109), 2 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-06 02:40:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 884 transitions. [2025-02-06 02:40:00,497 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 884 transitions. Word has length 483 [2025-02-06 02:40:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:00,497 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 884 transitions. [2025-02-06 02:40:00,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 884 transitions. [2025-02-06 02:40:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-06 02:40:00,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:00,503 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:00,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:40:00,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:00,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:00,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1757767498, now seen corresponding path program 1 times [2025-02-06 02:40:00,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:00,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689710360] [2025-02-06 02:40:00,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:00,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:00,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-06 02:40:00,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-06 02:40:00,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:00,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:00,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:00,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689710360] [2025-02-06 02:40:00,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689710360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:00,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:00,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004675596] [2025-02-06 02:40:00,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:00,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:00,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:00,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:00,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:00,786 INFO L87 Difference]: Start difference. First operand 558 states and 884 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:00,957 INFO L93 Difference]: Finished difference Result 1665 states and 2641 transitions. [2025-02-06 02:40:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:00,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-02-06 02:40:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:00,964 INFO L225 Difference]: With dead ends: 1665 [2025-02-06 02:40:00,965 INFO L226 Difference]: Without dead ends: 1110 [2025-02-06 02:40:00,966 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-02-06 02:40:00,967 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 406 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:00,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 864 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-02-06 02:40:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1108. [2025-02-06 02:40:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 885 states have (on average 1.4734463276836158) internal successors, (1304), 887 states have internal predecessors, (1304), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-02-06 02:40:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1740 transitions. [2025-02-06 02:40:01,079 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1740 transitions. Word has length 483 [2025-02-06 02:40:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:01,083 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1740 transitions. [2025-02-06 02:40:01,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1740 transitions. [2025-02-06 02:40:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-06 02:40:01,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:01,087 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:01,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:40:01,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:01,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash -177892789, now seen corresponding path program 1 times [2025-02-06 02:40:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:01,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990249670] [2025-02-06 02:40:01,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:01,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-06 02:40:01,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-06 02:40:01,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:01,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:01,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:01,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990249670] [2025-02-06 02:40:01,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990249670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:01,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:01,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817145381] [2025-02-06 02:40:01,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:01,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:01,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:01,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:01,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:01,577 INFO L87 Difference]: Start difference. First operand 1108 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:01,658 INFO L93 Difference]: Finished difference Result 2221 states and 3493 transitions. [2025-02-06 02:40:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-02-06 02:40:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:01,665 INFO L225 Difference]: With dead ends: 2221 [2025-02-06 02:40:01,666 INFO L226 Difference]: Without dead ends: 1116 [2025-02-06 02:40:01,668 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-02-06 02:40:01,669 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 0 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:01,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 853 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:40:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-02-06 02:40:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-02-06 02:40:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 893 states have (on average 1.469204927211646) internal successors, (1312), 895 states have internal predecessors, (1312), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-02-06 02:40:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1748 transitions. [2025-02-06 02:40:01,731 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1748 transitions. Word has length 483 [2025-02-06 02:40:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:01,732 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1748 transitions. [2025-02-06 02:40:01,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1748 transitions. [2025-02-06 02:40:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-06 02:40:01,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:01,736 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:01,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:40:01,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:01,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash -76980822, now seen corresponding path program 1 times [2025-02-06 02:40:01,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:01,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561766191] [2025-02-06 02:40:01,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:01,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-06 02:40:01,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-06 02:40:01,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:01,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561766191] [2025-02-06 02:40:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561766191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:02,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970987943] [2025-02-06 02:40:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:02,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:02,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:02,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:02,476 INFO L87 Difference]: Start difference. First operand 1116 states and 1748 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:02,878 INFO L93 Difference]: Finished difference Result 3120 states and 4880 transitions. [2025-02-06 02:40:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:02,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-02-06 02:40:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:02,887 INFO L225 Difference]: With dead ends: 3120 [2025-02-06 02:40:02,887 INFO L226 Difference]: Without dead ends: 2007 [2025-02-06 02:40:02,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:40:02,889 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 521 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:02,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1348 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:40:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2025-02-06 02:40:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1672. [2025-02-06 02:40:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1338 states have (on average 1.4618834080717489) internal successors, (1956), 1341 states have internal predecessors, (1956), 327 states have call successors, (327), 6 states have call predecessors, (327), 6 states have return successors, (327), 324 states have call predecessors, (327), 327 states have call successors, (327) [2025-02-06 02:40:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2610 transitions. [2025-02-06 02:40:02,981 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2610 transitions. Word has length 483 [2025-02-06 02:40:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:02,982 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2610 transitions. [2025-02-06 02:40:02,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2610 transitions. [2025-02-06 02:40:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-06 02:40:02,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:02,987 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:02,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:40:02,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:02,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1031834377, now seen corresponding path program 1 times [2025-02-06 02:40:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:02,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313116125] [2025-02-06 02:40:02,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:03,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-06 02:40:03,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-06 02:40:03,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:03,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:03,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:03,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313116125] [2025-02-06 02:40:03,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313116125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:03,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:03,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:40:03,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405938379] [2025-02-06 02:40:03,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:03,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:40:03,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:03,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:40:03,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:40:03,919 INFO L87 Difference]: Start difference. First operand 1672 states and 2610 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:04,669 INFO L93 Difference]: Finished difference Result 2945 states and 4605 transitions. [2025-02-06 02:40:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:40:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-02-06 02:40:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:04,680 INFO L225 Difference]: With dead ends: 2945 [2025-02-06 02:40:04,680 INFO L226 Difference]: Without dead ends: 1832 [2025-02-06 02:40:04,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:40:04,684 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 503 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:04,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1322 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:40:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2025-02-06 02:40:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1731. [2025-02-06 02:40:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1397 states have (on average 1.4652827487473157) internal successors, (2047), 1400 states have internal predecessors, (2047), 327 states have call successors, (327), 6 states have call predecessors, (327), 6 states have return successors, (327), 324 states have call predecessors, (327), 327 states have call successors, (327) [2025-02-06 02:40:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2701 transitions. [2025-02-06 02:40:04,782 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2701 transitions. Word has length 483 [2025-02-06 02:40:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:04,783 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2701 transitions. [2025-02-06 02:40:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2701 transitions. [2025-02-06 02:40:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-06 02:40:04,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:04,787 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:04,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:40:04,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:04,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1430421509, now seen corresponding path program 1 times [2025-02-06 02:40:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:04,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094184833] [2025-02-06 02:40:04,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:04,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-06 02:40:04,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-06 02:40:04,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:04,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:05,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:05,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094184833] [2025-02-06 02:40:05,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094184833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:05,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:05,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:40:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048821262] [2025-02-06 02:40:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:05,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:40:05,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:05,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:40:05,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:40:05,258 INFO L87 Difference]: Start difference. First operand 1731 states and 2701 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:06,361 INFO L93 Difference]: Finished difference Result 6819 states and 10633 transitions. [2025-02-06 02:40:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:40:06,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 484 [2025-02-06 02:40:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:06,390 INFO L225 Difference]: With dead ends: 6819 [2025-02-06 02:40:06,390 INFO L226 Difference]: Without dead ends: 5091 [2025-02-06 02:40:06,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:40:06,397 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1196 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:06,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 2180 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:40:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2025-02-06 02:40:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 4062. [2025-02-06 02:40:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 3395 states have (on average 1.4857142857142858) internal successors, (5044), 3401 states have internal predecessors, (5044), 654 states have call successors, (654), 12 states have call predecessors, (654), 12 states have return successors, (654), 648 states have call predecessors, (654), 654 states have call successors, (654) [2025-02-06 02:40:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 6352 transitions. [2025-02-06 02:40:06,636 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 6352 transitions. Word has length 484 [2025-02-06 02:40:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:06,638 INFO L471 AbstractCegarLoop]: Abstraction has 4062 states and 6352 transitions. [2025-02-06 02:40:06,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 6352 transitions. [2025-02-06 02:40:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-06 02:40:06,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:06,643 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:06,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:40:06,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:06,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1935980134, now seen corresponding path program 1 times [2025-02-06 02:40:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:06,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384727938] [2025-02-06 02:40:06,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:06,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-06 02:40:09,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-06 02:40:09,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:09,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 24 proven. 186 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:40:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384727938] [2025-02-06 02:40:10,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384727938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:40:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107480432] [2025-02-06 02:40:10,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:10,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:40:10,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:40:10,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-06 02:40:10,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-06 02:40:10,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:10,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:10,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:40:10,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:40:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 1618 proven. 192 refuted. 0 times theorem prover too weak. 8130 trivial. 0 not checked. [2025-02-06 02:40:11,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:40:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 18 proven. 192 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:40:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107480432] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:40:12,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:40:12,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2025-02-06 02:40:12,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272183659] [2025-02-06 02:40:12,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:40:12,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:40:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:12,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:40:12,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:40:12,078 INFO L87 Difference]: Start difference. First operand 4062 states and 6352 transitions. Second operand has 13 states, 13 states have (on average 22.846153846153847) internal successors, (297), 13 states have internal predecessors, (297), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (201), 4 states have call predecessors, (201), 4 states have call successors, (201) [2025-02-06 02:40:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:13,796 INFO L93 Difference]: Finished difference Result 15147 states and 23369 transitions. [2025-02-06 02:40:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-06 02:40:13,797 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 22.846153846153847) internal successors, (297), 13 states have internal predecessors, (297), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (201), 4 states have call predecessors, (201), 4 states have call successors, (201) Word has length 484 [2025-02-06 02:40:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:13,856 INFO L225 Difference]: With dead ends: 15147 [2025-02-06 02:40:13,859 INFO L226 Difference]: Without dead ends: 11088 [2025-02-06 02:40:13,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 966 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 02:40:13,874 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 2274 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2275 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:13,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2275 Valid, 1910 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:40:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11088 states. [2025-02-06 02:40:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11088 to 9723. [2025-02-06 02:40:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9723 states, 8828 states have (on average 1.4926370638876303) internal successors, (13177), 8846 states have internal predecessors, (13177), 822 states have call successors, (822), 72 states have call predecessors, (822), 72 states have return successors, (822), 804 states have call predecessors, (822), 822 states have call successors, (822) [2025-02-06 02:40:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9723 states to 9723 states and 14821 transitions. [2025-02-06 02:40:14,280 INFO L78 Accepts]: Start accepts. Automaton has 9723 states and 14821 transitions. Word has length 484 [2025-02-06 02:40:14,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:14,280 INFO L471 AbstractCegarLoop]: Abstraction has 9723 states and 14821 transitions. [2025-02-06 02:40:14,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.846153846153847) internal successors, (297), 13 states have internal predecessors, (297), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (201), 4 states have call predecessors, (201), 4 states have call successors, (201) [2025-02-06 02:40:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 9723 states and 14821 transitions. [2025-02-06 02:40:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-06 02:40:14,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:14,295 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:14,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:40:14,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:14,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:14,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1424493018, now seen corresponding path program 1 times [2025-02-06 02:40:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:14,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949132704] [2025-02-06 02:40:14,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:14,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-06 02:40:16,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-06 02:40:16,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:16,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 48 proven. 162 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:40:17,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:17,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949132704] [2025-02-06 02:40:17,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949132704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:40:17,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11654487] [2025-02-06 02:40:17,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:17,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:17,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:17,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:40:17,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:40:17,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-06 02:40:17,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-06 02:40:17,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:17,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:17,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:40:17,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:40:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 4110 proven. 150 refuted. 0 times theorem prover too weak. 5680 trivial. 0 not checked. [2025-02-06 02:40:17,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:40:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 60 proven. 150 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:40:18,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11654487] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:40:18,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:40:18,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 02:40:18,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854318241] [2025-02-06 02:40:18,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:40:18,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:40:18,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:18,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:40:18,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:40:18,317 INFO L87 Difference]: Start difference. First operand 9723 states and 14821 transitions. Second operand has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 4 states have call successors, (175), 2 states have call predecessors, (175), 4 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) [2025-02-06 02:40:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:18,957 INFO L93 Difference]: Finished difference Result 18825 states and 28694 transitions. [2025-02-06 02:40:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:40:18,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 4 states have call successors, (175), 2 states have call predecessors, (175), 4 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) Word has length 484 [2025-02-06 02:40:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:18,989 INFO L225 Difference]: With dead ends: 18825 [2025-02-06 02:40:18,989 INFO L226 Difference]: Without dead ends: 9093 [2025-02-06 02:40:19,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 965 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:40:19,013 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 469 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:19,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 807 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:40:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9093 states. [2025-02-06 02:40:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9093 to 9069. [2025-02-06 02:40:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9069 states, 8150 states have (on average 1.4802453987730062) internal successors, (12064), 8168 states have internal predecessors, (12064), 822 states have call successors, (822), 96 states have call predecessors, (822), 96 states have return successors, (822), 804 states have call predecessors, (822), 822 states have call successors, (822) [2025-02-06 02:40:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9069 states to 9069 states and 13708 transitions. [2025-02-06 02:40:19,405 INFO L78 Accepts]: Start accepts. Automaton has 9069 states and 13708 transitions. Word has length 484 [2025-02-06 02:40:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:19,406 INFO L471 AbstractCegarLoop]: Abstraction has 9069 states and 13708 transitions. [2025-02-06 02:40:19,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 4 states have call successors, (175), 2 states have call predecessors, (175), 4 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) [2025-02-06 02:40:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 9069 states and 13708 transitions. [2025-02-06 02:40:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-06 02:40:19,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:19,415 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:19,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:40:19,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:19,620 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:19,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:19,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1481508167, now seen corresponding path program 1 times [2025-02-06 02:40:19,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:19,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034496625] [2025-02-06 02:40:19,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:19,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:19,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-06 02:40:19,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-06 02:40:19,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:19,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034496625] [2025-02-06 02:40:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034496625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:19,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:19,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:19,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49161577] [2025-02-06 02:40:19,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:19,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:19,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:19,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:19,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:19,906 INFO L87 Difference]: Start difference. First operand 9069 states and 13708 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:20,351 INFO L93 Difference]: Finished difference Result 18167 states and 27438 transitions. [2025-02-06 02:40:20,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:20,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 486 [2025-02-06 02:40:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:20,376 INFO L225 Difference]: With dead ends: 18167 [2025-02-06 02:40:20,376 INFO L226 Difference]: Without dead ends: 9101 [2025-02-06 02:40:20,390 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-02-06 02:40:20,390 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 267 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:20,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 960 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9101 states. [2025-02-06 02:40:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9101 to 7881. [2025-02-06 02:40:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7881 states, 7316 states have (on average 1.494805904866047) internal successors, (10936), 7322 states have internal predecessors, (10936), 510 states have call successors, (510), 54 states have call predecessors, (510), 54 states have return successors, (510), 504 states have call predecessors, (510), 510 states have call successors, (510) [2025-02-06 02:40:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7881 states to 7881 states and 11956 transitions. [2025-02-06 02:40:20,925 INFO L78 Accepts]: Start accepts. Automaton has 7881 states and 11956 transitions. Word has length 486 [2025-02-06 02:40:20,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:20,926 INFO L471 AbstractCegarLoop]: Abstraction has 7881 states and 11956 transitions. [2025-02-06 02:40:20,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 7881 states and 11956 transitions. [2025-02-06 02:40:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-02-06 02:40:20,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:20,935 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:20,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:40:20,936 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:20,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -880994532, now seen corresponding path program 1 times [2025-02-06 02:40:20,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:20,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420471547] [2025-02-06 02:40:20,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:20,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-02-06 02:40:21,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-02-06 02:40:21,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:21,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:21,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:21,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420471547] [2025-02-06 02:40:21,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420471547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:21,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:21,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:21,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007894864] [2025-02-06 02:40:21,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:21,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:21,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:21,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:21,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:21,321 INFO L87 Difference]: Start difference. First operand 7881 states and 11956 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:21,716 INFO L93 Difference]: Finished difference Result 23637 states and 35862 transitions. [2025-02-06 02:40:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:21,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 487 [2025-02-06 02:40:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:21,752 INFO L225 Difference]: With dead ends: 23637 [2025-02-06 02:40:21,752 INFO L226 Difference]: Without dead ends: 15759 [2025-02-06 02:40:21,764 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-02-06 02:40:21,766 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 278 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:21,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 960 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15759 states. [2025-02-06 02:40:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15759 to 15757. [2025-02-06 02:40:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15757 states, 14628 states have (on average 1.4887886245556468) internal successors, (21778), 14640 states have internal predecessors, (21778), 1020 states have call successors, (1020), 108 states have call predecessors, (1020), 108 states have return successors, (1020), 1008 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-02-06 02:40:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15757 states to 15757 states and 23818 transitions. [2025-02-06 02:40:22,253 INFO L78 Accepts]: Start accepts. Automaton has 15757 states and 23818 transitions. Word has length 487 [2025-02-06 02:40:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:22,254 INFO L471 AbstractCegarLoop]: Abstraction has 15757 states and 23818 transitions. [2025-02-06 02:40:22,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 15757 states and 23818 transitions. [2025-02-06 02:40:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-06 02:40:22,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:22,268 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:22,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:40:22,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:22,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1695446663, now seen corresponding path program 1 times [2025-02-06 02:40:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:22,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104387108] [2025-02-06 02:40:22,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:22,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:22,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-06 02:40:22,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-06 02:40:22,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:22,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104387108] [2025-02-06 02:40:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104387108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:22,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:40:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882006922] [2025-02-06 02:40:22,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:22,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:40:22,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:22,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:40:22,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:40:22,883 INFO L87 Difference]: Start difference. First operand 15757 states and 23818 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:23,759 INFO L93 Difference]: Finished difference Result 46199 states and 69811 transitions. [2025-02-06 02:40:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:40:23,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 488 [2025-02-06 02:40:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:23,827 INFO L225 Difference]: With dead ends: 46199 [2025-02-06 02:40:23,827 INFO L226 Difference]: Without dead ends: 30445 [2025-02-06 02:40:23,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:40:23,850 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 729 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:23,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1657 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:40:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30445 states. [2025-02-06 02:40:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30445 to 23651. [2025-02-06 02:40:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23651 states, 21958 states have (on average 1.4860187630931778) internal successors, (32630), 21976 states have internal predecessors, (32630), 1530 states have call successors, (1530), 162 states have call predecessors, (1530), 162 states have return successors, (1530), 1512 states have call predecessors, (1530), 1530 states have call successors, (1530) [2025-02-06 02:40:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23651 states to 23651 states and 35690 transitions. [2025-02-06 02:40:24,648 INFO L78 Accepts]: Start accepts. Automaton has 23651 states and 35690 transitions. Word has length 488 [2025-02-06 02:40:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:24,649 INFO L471 AbstractCegarLoop]: Abstraction has 23651 states and 35690 transitions. [2025-02-06 02:40:24,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 23651 states and 35690 transitions. [2025-02-06 02:40:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-06 02:40:24,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:24,661 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:24,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:40:24,661 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:24,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash -193540138, now seen corresponding path program 1 times [2025-02-06 02:40:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098533470] [2025-02-06 02:40:24,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:24,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:24,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-06 02:40:24,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-06 02:40:24,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:24,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-06 02:40:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098533470] [2025-02-06 02:40:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098533470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:25,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:25,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:25,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919141662] [2025-02-06 02:40:25,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:25,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:25,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:25,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:25,435 INFO L87 Difference]: Start difference. First operand 23651 states and 35690 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:27,323 INFO L93 Difference]: Finished difference Result 64815 states and 97550 transitions. [2025-02-06 02:40:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:27,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 488 [2025-02-06 02:40:27,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:27,506 INFO L225 Difference]: With dead ends: 64815 [2025-02-06 02:40:27,506 INFO L226 Difference]: Without dead ends: 41167 [2025-02-06 02:40:27,528 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-02-06 02:40:27,529 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 607 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:27,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1063 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:40:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41167 states. [2025-02-06 02:40:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41167 to 23271. [2025-02-06 02:40:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23271 states, 21578 states have (on average 1.4829455927333395) internal successors, (31999), 21596 states have internal predecessors, (31999), 1530 states have call successors, (1530), 162 states have call predecessors, (1530), 162 states have return successors, (1530), 1512 states have call predecessors, (1530), 1530 states have call successors, (1530) [2025-02-06 02:40:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23271 states to 23271 states and 35059 transitions. [2025-02-06 02:40:28,548 INFO L78 Accepts]: Start accepts. Automaton has 23271 states and 35059 transitions. Word has length 488 [2025-02-06 02:40:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:28,549 INFO L471 AbstractCegarLoop]: Abstraction has 23271 states and 35059 transitions. [2025-02-06 02:40:28,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-06 02:40:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23271 states and 35059 transitions. [2025-02-06 02:40:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-06 02:40:28,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:28,559 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:28,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:40:28,559 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:28,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:28,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1822836726, now seen corresponding path program 1 times [2025-02-06 02:40:28,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:28,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289347102] [2025-02-06 02:40:28,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:28,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:28,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-06 02:40:29,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-06 02:40:29,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:29,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 48 proven. 162 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:40:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289347102] [2025-02-06 02:40:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289347102] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:40:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467899775] [2025-02-06 02:40:30,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:30,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:30,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:30,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:40:30,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:40:30,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-06 02:40:30,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-06 02:40:30,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:30,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:30,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 02:40:30,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:40:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 3614 proven. 318 refuted. 0 times theorem prover too weak. 6008 trivial. 0 not checked. [2025-02-06 02:40:32,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:40:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 96 proven. 321 refuted. 0 times theorem prover too weak. 9523 trivial. 0 not checked. [2025-02-06 02:40:33,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467899775] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:40:33,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:40:33,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 20 [2025-02-06 02:40:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801452342] [2025-02-06 02:40:33,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:40:33,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 02:40:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:33,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 02:40:33,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:40:33,392 INFO L87 Difference]: Start difference. First operand 23271 states and 35059 transitions. Second operand has 20 states, 19 states have (on average 16.473684210526315) internal successors, (313), 18 states have internal predecessors, (313), 8 states have call successors, (213), 4 states have call predecessors, (213), 8 states have return successors, (213), 8 states have call predecessors, (213), 8 states have call successors, (213) [2025-02-06 02:40:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:39,012 INFO L93 Difference]: Finished difference Result 105831 states and 160702 transitions. [2025-02-06 02:40:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 02:40:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 16.473684210526315) internal successors, (313), 18 states have internal predecessors, (313), 8 states have call successors, (213), 4 states have call predecessors, (213), 8 states have return successors, (213), 8 states have call predecessors, (213), 8 states have call successors, (213) Word has length 488 [2025-02-06 02:40:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:39,172 INFO L225 Difference]: With dead ends: 105831 [2025-02-06 02:40:39,172 INFO L226 Difference]: Without dead ends: 82563 [2025-02-06 02:40:39,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=469, Invalid=1171, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 02:40:39,213 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 4158 mSDsluCounter, 5417 mSDsCounter, 0 mSdLazyCounter, 4020 mSolverCounterSat, 960 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4263 SdHoareTripleChecker+Valid, 6090 SdHoareTripleChecker+Invalid, 4980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 960 IncrementalHoareTripleChecker+Valid, 4020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:39,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4263 Valid, 6090 Invalid, 4980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [960 Valid, 4020 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-06 02:40:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82563 states. [2025-02-06 02:40:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82563 to 43027. [2025-02-06 02:40:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43027 states, 40320 states have (on average 1.4856150793650793) internal successors, (59900), 40368 states have internal predecessors, (59900), 2400 states have call successors, (2400), 306 states have call predecessors, (2400), 306 states have return successors, (2400), 2352 states have call predecessors, (2400), 2400 states have call successors, (2400) [2025-02-06 02:40:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43027 states to 43027 states and 64700 transitions. [2025-02-06 02:40:41,450 INFO L78 Accepts]: Start accepts. Automaton has 43027 states and 64700 transitions. Word has length 488 [2025-02-06 02:40:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:41,451 INFO L471 AbstractCegarLoop]: Abstraction has 43027 states and 64700 transitions. [2025-02-06 02:40:41,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 16.473684210526315) internal successors, (313), 18 states have internal predecessors, (313), 8 states have call successors, (213), 4 states have call predecessors, (213), 8 states have return successors, (213), 8 states have call predecessors, (213), 8 states have call successors, (213) [2025-02-06 02:40:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 43027 states and 64700 transitions. [2025-02-06 02:40:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-06 02:40:41,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:41,461 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:41,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 02:40:41,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 02:40:41,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:41,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash -854281981, now seen corresponding path program 1 times [2025-02-06 02:40:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:41,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679040422] [2025-02-06 02:40:41,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:41,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-06 02:40:45,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-06 02:40:45,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:45,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 168 proven. 42 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-02-06 02:40:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679040422] [2025-02-06 02:40:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679040422] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:40:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984912852] [2025-02-06 02:40:46,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:46,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:46,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:46,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:40:46,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:40:46,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-06 02:40:46,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-06 02:40:46,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:46,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:46,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 02:40:46,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:40:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 4520 proven. 753 refuted. 0 times theorem prover too weak. 4667 trivial. 0 not checked. [2025-02-06 02:40:50,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:40:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 231 proven. 591 refuted. 0 times theorem prover too weak. 9118 trivial. 0 not checked. [2025-02-06 02:40:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984912852] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:40:52,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:40:52,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 19] total 44 [2025-02-06 02:40:52,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914424600] [2025-02-06 02:40:52,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:40:52,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-06 02:40:52,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:52,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-06 02:40:52,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1591, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 02:40:52,301 INFO L87 Difference]: Start difference. First operand 43027 states and 64700 transitions. Second operand has 44 states, 43 states have (on average 8.744186046511627) internal successors, (376), 42 states have internal predecessors, (376), 12 states have call successors, (206), 6 states have call predecessors, (206), 13 states have return successors, (207), 12 states have call predecessors, (207), 12 states have call successors, (207)