./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.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_amount250_file-62.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 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:19:37,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:19:37,931 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:19:37,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:19:37,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:19:37,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:19:37,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:19:37,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:19:37,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:19:37,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:19:37,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:19:37,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:19:37,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:19:37,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:19:37,963 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:19:37,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:19:37,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:19:37,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:19:37,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:19:37,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:19:37,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:19:37,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:19:37,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:19:37,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:19:37,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:19:37,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:19:37,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:19:37,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:19:37,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:19:37,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:19:37,966 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 -> 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 [2025-02-06 02:19:38,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:19:38,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:19:38,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:19:38,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:19:38,237 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:19:38,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i [2025-02-06 02:19:39,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f00fb242/93bdc5d7028048f5b539758d27fbb9a0/FLAG49f20cf98 [2025-02-06 02:19:39,692 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:19:39,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i [2025-02-06 02:19:39,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f00fb242/93bdc5d7028048f5b539758d27fbb9a0/FLAG49f20cf98 [2025-02-06 02:19:39,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f00fb242/93bdc5d7028048f5b539758d27fbb9a0 [2025-02-06 02:19:39,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:19:39,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:19:39,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:19:39,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:19:39,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:19:39,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:19:39" (1/1) ... [2025-02-06 02:19:39,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bacfa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:39, skipping insertion in model container [2025-02-06 02:19:39,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:19:39" (1/1) ... [2025-02-06 02:19:39,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:19:39,829 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_amount250_file-62.i[916,929] [2025-02-06 02:19:39,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:19:39,933 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:19:39,939 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_amount250_file-62.i[916,929] [2025-02-06 02:19:40,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:19:40,072 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:19:40,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40 WrapperNode [2025-02-06 02:19:40,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:19:40,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:19:40,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:19:40,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:19:40,079 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:19:40" (1/1) ... [2025-02-06 02:19:40,095 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:19:40" (1/1) ... [2025-02-06 02:19:40,155 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2025-02-06 02:19:40,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:19:40,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:19:40,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:19:40,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:19:40,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,211 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:19:40,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:19:40,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:19:40,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:19:40,245 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:19:40,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (1/1) ... [2025-02-06 02:19:40,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:19:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:40,283 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:19:40,294 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:19:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:19:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:19:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:19:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:19:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:19:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:19:40,429 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:19:40,430 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:19:40,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc property_#t~bitwise41#1;havoc property_#t~short42#1;havoc property_#t~bitwise43#1;havoc property_#t~short44#1; [2025-02-06 02:19:40,973 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-02-06 02:19:40,973 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:19:40,993 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:19:40,993 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:19:40,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:19:40 BoogieIcfgContainer [2025-02-06 02:19:40,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:19:40,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:19:40,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:19:41,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:19:41,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:19:39" (1/3) ... [2025-02-06 02:19:41,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408d1f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:19:41, skipping insertion in model container [2025-02-06 02:19:41,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:40" (2/3) ... [2025-02-06 02:19:41,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408d1f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:19:41, skipping insertion in model container [2025-02-06 02:19:41,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:19:40" (3/3) ... [2025-02-06 02:19:41,003 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-62.i [2025-02-06 02:19:41,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:19:41,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-62.i that has 2 procedures, 186 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:19:41,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:19:41,073 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;@17387739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:19:41,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:19:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 128 states have internal predecessors, (186), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 02:19:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-02-06 02:19:41,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:41,096 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:41,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:41,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash 162657793, now seen corresponding path program 1 times [2025-02-06 02:19:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:41,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764331134] [2025-02-06 02:19:41,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:41,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:41,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-06 02:19:41,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-06 02:19:41,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:41,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-02-06 02:19:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764331134] [2025-02-06 02:19:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764331134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681763254] [2025-02-06 02:19:41,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:41,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:41,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:41,603 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:19:41,604 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:19:41,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-06 02:19:41,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-06 02:19:41,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:41,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:41,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:19:41,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-02-06 02:19:41,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:19:41,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681763254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:41,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:19:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:19:41,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223842843] [2025-02-06 02:19:41,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:41,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:19:41,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:41,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:19:41,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:19:41,945 INFO L87 Difference]: Start difference. First operand has 186 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 128 states have internal predecessors, (186), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:19:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:41,983 INFO L93 Difference]: Finished difference Result 364 states and 645 transitions. [2025-02-06 02:19:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:19:41,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 369 [2025-02-06 02:19:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:41,990 INFO L225 Difference]: With dead ends: 364 [2025-02-06 02:19:41,990 INFO L226 Difference]: Without dead ends: 181 [2025-02-06 02:19:41,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 370 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:19:41,994 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:41,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:19:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-06 02:19:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-02-06 02:19:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 123 states have (on average 1.4390243902439024) internal successors, (177), 123 states have internal predecessors, (177), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 02:19:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2025-02-06 02:19:42,045 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 369 [2025-02-06 02:19:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:42,045 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2025-02-06 02:19:42,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:19:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2025-02-06 02:19:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-02-06 02:19:42,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:42,050 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:42,058 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:19:42,255 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:19:42,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:42,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash -320275617, now seen corresponding path program 1 times [2025-02-06 02:19:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453021873] [2025-02-06 02:19:42,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:42,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-06 02:19:42,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-06 02:19:42,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:42,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:19:42,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:42,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453021873] [2025-02-06 02:19:42,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453021873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:42,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:42,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:19:42,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210383091] [2025-02-06 02:19:42,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:42,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:19:42,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:42,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:19:42,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:19:42,678 INFO L87 Difference]: Start difference. First operand 181 states and 289 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:42,780 INFO L93 Difference]: Finished difference Result 520 states and 831 transitions. [2025-02-06 02:19:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:19:42,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 369 [2025-02-06 02:19:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:42,788 INFO L225 Difference]: With dead ends: 520 [2025-02-06 02:19:42,788 INFO L226 Difference]: Without dead ends: 342 [2025-02-06 02:19:42,792 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:19:42,793 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 254 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:42,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 774 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:19:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-06 02:19:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 199. [2025-02-06 02:19:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 141 states have internal predecessors, (207), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 02:19:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 319 transitions. [2025-02-06 02:19:42,825 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 319 transitions. Word has length 369 [2025-02-06 02:19:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:42,827 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 319 transitions. [2025-02-06 02:19:42,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 319 transitions. [2025-02-06 02:19:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-06 02:19:42,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:42,834 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:42,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:19:42,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:42,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1087188477, now seen corresponding path program 1 times [2025-02-06 02:19:42,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:42,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756204868] [2025-02-06 02:19:42,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:42,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:42,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-06 02:19:42,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-06 02:19:42,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:42,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:19:43,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756204868] [2025-02-06 02:19:43,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756204868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:43,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:43,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:43,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815277440] [2025-02-06 02:19:43,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:43,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:43,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:43,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:43,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:43,474 INFO L87 Difference]: Start difference. First operand 199 states and 319 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:43,559 INFO L93 Difference]: Finished difference Result 591 states and 951 transitions. [2025-02-06 02:19:43,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:43,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2025-02-06 02:19:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:43,562 INFO L225 Difference]: With dead ends: 591 [2025-02-06 02:19:43,565 INFO L226 Difference]: Without dead ends: 395 [2025-02-06 02:19:43,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:19:43,566 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 163 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:43,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 962 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:19:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-06 02:19:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2025-02-06 02:19:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 278 states have (on average 1.4712230215827338) internal successors, (409), 278 states have internal predecessors, (409), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 02:19:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 633 transitions. [2025-02-06 02:19:43,604 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 633 transitions. Word has length 370 [2025-02-06 02:19:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:43,604 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 633 transitions. [2025-02-06 02:19:43,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 633 transitions. [2025-02-06 02:19:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-06 02:19:43,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:43,608 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:43,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:19:43,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:43,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash -545615522, now seen corresponding path program 1 times [2025-02-06 02:19:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:43,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993329469] [2025-02-06 02:19:43,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:43,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-06 02:19:43,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-06 02:19:43,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:43,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:19:43,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993329469] [2025-02-06 02:19:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993329469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:43,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137194758] [2025-02-06 02:19:43,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:43,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:43,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:43,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:43,904 INFO L87 Difference]: Start difference. First operand 393 states and 633 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:43,932 INFO L93 Difference]: Finished difference Result 395 states and 634 transitions. [2025-02-06 02:19:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:43,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2025-02-06 02:19:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:43,935 INFO L225 Difference]: With dead ends: 395 [2025-02-06 02:19:43,935 INFO L226 Difference]: Without dead ends: 199 [2025-02-06 02:19:43,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:43,936 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:43,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 839 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:19:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-06 02:19:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-06 02:19:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 141 states have internal predecessors, (205), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 02:19:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2025-02-06 02:19:43,948 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 370 [2025-02-06 02:19:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:43,949 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2025-02-06 02:19:43,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2025-02-06 02:19:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-02-06 02:19:43,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:43,952 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:43,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:19:43,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:43,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash -201725444, now seen corresponding path program 1 times [2025-02-06 02:19:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:43,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017915199] [2025-02-06 02:19:43,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:43,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-06 02:19:44,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-06 02:19:44,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:44,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:19:44,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:44,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017915199] [2025-02-06 02:19:44,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017915199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:44,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:44,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:19:44,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236032856] [2025-02-06 02:19:44,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:44,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:19:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:44,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:19:44,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:44,649 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:44,997 INFO L93 Difference]: Finished difference Result 592 states and 946 transitions. [2025-02-06 02:19:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:44,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 371 [2025-02-06 02:19:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:45,000 INFO L225 Difference]: With dead ends: 592 [2025-02-06 02:19:45,000 INFO L226 Difference]: Without dead ends: 396 [2025-02-06 02:19:45,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:19:45,001 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 174 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:45,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 980 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:19:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-06 02:19:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 308. [2025-02-06 02:19:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 193 states have internal predecessors, (265), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 02:19:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 489 transitions. [2025-02-06 02:19:45,032 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 489 transitions. Word has length 371 [2025-02-06 02:19:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:45,032 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 489 transitions. [2025-02-06 02:19:45,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 489 transitions. [2025-02-06 02:19:45,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-06 02:19:45,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:45,040 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:45,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:19:45,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:45,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1510698360, now seen corresponding path program 1 times [2025-02-06 02:19:45,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:45,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803030801] [2025-02-06 02:19:45,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:45,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:19:45,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:19:45,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:19:45,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:45,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803030801] [2025-02-06 02:19:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803030801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:45,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291580428] [2025-02-06 02:19:45,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:45,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:45,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:45,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:45,535 INFO L87 Difference]: Start difference. First operand 308 states and 489 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:45,638 INFO L93 Difference]: Finished difference Result 504 states and 803 transitions. [2025-02-06 02:19:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-02-06 02:19:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:45,641 INFO L225 Difference]: With dead ends: 504 [2025-02-06 02:19:45,641 INFO L226 Difference]: Without dead ends: 308 [2025-02-06 02:19:45,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:19:45,645 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 161 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:45,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 529 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:19:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-06 02:19:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-02-06 02:19:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 193 states have internal predecessors, (264), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 02:19:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 488 transitions. [2025-02-06 02:19:45,676 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 488 transitions. Word has length 372 [2025-02-06 02:19:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:45,677 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 488 transitions. [2025-02-06 02:19:45,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 488 transitions. [2025-02-06 02:19:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-06 02:19:45,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:45,683 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:45,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:19:45,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:45,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash -746212647, now seen corresponding path program 1 times [2025-02-06 02:19:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:45,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4668624] [2025-02-06 02:19:45,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:45,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:19:46,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:19:46,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:46,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:19:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4668624] [2025-02-06 02:19:46,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4668624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254599638] [2025-02-06 02:19:46,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:46,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:46,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:46,848 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:19:46,854 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:19:46,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:19:47,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:19:47,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:47,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:47,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 02:19:47,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4269 proven. 213 refuted. 0 times theorem prover too weak. 1678 trivial. 0 not checked. [2025-02-06 02:19:48,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:19:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 411 proven. 231 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-02-06 02:19:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254599638] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:19:49,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:19:49,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 28 [2025-02-06 02:19:49,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671594306] [2025-02-06 02:19:49,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:19:49,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 02:19:49,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:49,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 02:19:49,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2025-02-06 02:19:49,232 INFO L87 Difference]: Start difference. First operand 308 states and 488 transitions. Second operand has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) [2025-02-06 02:19:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:50,880 INFO L93 Difference]: Finished difference Result 664 states and 1003 transitions. [2025-02-06 02:19:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 02:19:50,881 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) Word has length 372 [2025-02-06 02:19:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:50,886 INFO L225 Difference]: With dead ends: 664 [2025-02-06 02:19:50,887 INFO L226 Difference]: Without dead ends: 468 [2025-02-06 02:19:50,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=894, Invalid=2412, Unknown=0, NotChecked=0, Total=3306 [2025-02-06 02:19:50,889 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 811 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:50,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1351 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:19:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-06 02:19:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 445. [2025-02-06 02:19:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 313 states have (on average 1.3706070287539935) internal successors, (429), 314 states have internal predecessors, (429), 117 states have call successors, (117), 14 states have call predecessors, (117), 14 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 02:19:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 663 transitions. [2025-02-06 02:19:50,938 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 663 transitions. Word has length 372 [2025-02-06 02:19:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:50,939 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 663 transitions. [2025-02-06 02:19:50,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) [2025-02-06 02:19:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 663 transitions. [2025-02-06 02:19:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-06 02:19:50,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:50,946 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:19:51,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:51,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:51,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1277871279, now seen corresponding path program 1 times [2025-02-06 02:19:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:51,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365856796] [2025-02-06 02:19:51,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:51,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:51,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:19:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:19:51,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:51,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:19:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365856796] [2025-02-06 02:19:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365856796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:19:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932258386] [2025-02-06 02:19:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:52,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:19:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:52,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:19:52,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:19:52,499 INFO L87 Difference]: Start difference. First operand 445 states and 663 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:53,084 INFO L93 Difference]: Finished difference Result 736 states and 1081 transitions. [2025-02-06 02:19:53,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:19:53,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2025-02-06 02:19:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:53,089 INFO L225 Difference]: With dead ends: 736 [2025-02-06 02:19:53,089 INFO L226 Difference]: Without dead ends: 427 [2025-02-06 02:19:53,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:19:53,090 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 276 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:53,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 758 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:19:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-06 02:19:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 411. [2025-02-06 02:19:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 277 states have (on average 1.296028880866426) internal successors, (359), 278 states have internal predecessors, (359), 117 states have call successors, (117), 16 states have call predecessors, (117), 16 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 02:19:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 593 transitions. [2025-02-06 02:19:53,157 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 593 transitions. Word has length 374 [2025-02-06 02:19:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:53,158 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 593 transitions. [2025-02-06 02:19:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 593 transitions. [2025-02-06 02:19:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-06 02:19:53,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:53,164 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:53,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:19:53,164 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:53,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 259058335, now seen corresponding path program 1 times [2025-02-06 02:19:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891900200] [2025-02-06 02:19:53,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:53,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:53,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:19:53,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:19:53,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:53,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:19:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891900200] [2025-02-06 02:19:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891900200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:53,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:53,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:19:53,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217383821] [2025-02-06 02:19:53,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:53,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:19:53,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:53,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:19:53,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:19:53,329 INFO L87 Difference]: Start difference. First operand 411 states and 593 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:53,404 INFO L93 Difference]: Finished difference Result 682 states and 990 transitions. [2025-02-06 02:19:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:19:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2025-02-06 02:19:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:53,408 INFO L225 Difference]: With dead ends: 682 [2025-02-06 02:19:53,408 INFO L226 Difference]: Without dead ends: 411 [2025-02-06 02:19:53,410 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:19:53,411 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:53,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:19:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-06 02:19:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-02-06 02:19:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 277 states have (on average 1.288808664259928) internal successors, (357), 278 states have internal predecessors, (357), 117 states have call successors, (117), 16 states have call predecessors, (117), 16 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 02:19:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 591 transitions. [2025-02-06 02:19:53,442 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 591 transitions. Word has length 374 [2025-02-06 02:19:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:53,442 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 591 transitions. [2025-02-06 02:19:53,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 591 transitions. [2025-02-06 02:19:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-06 02:19:53,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:53,446 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:53,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:19:53,446 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:53,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1548396128, now seen corresponding path program 1 times [2025-02-06 02:19:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:53,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623496003] [2025-02-06 02:19:53,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:53,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:53,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:19:53,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:19:53,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:53,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 108 proven. 369 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2025-02-06 02:19:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:54,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623496003] [2025-02-06 02:19:54,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623496003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:54,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760089295] [2025-02-06 02:19:54,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:54,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:54,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:54,722 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:19:54,725 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:19:54,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:19:54,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:19:54,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:54,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:54,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 02:19:54,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3151 proven. 252 refuted. 0 times theorem prover too weak. 2757 trivial. 0 not checked. [2025-02-06 02:19:56,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:19:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 72 proven. 255 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-02-06 02:19:56,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760089295] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:19:56,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:19:56,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-02-06 02:19:56,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656307464] [2025-02-06 02:19:56,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:19:56,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 02:19:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:56,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 02:19:56,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2025-02-06 02:19:56,739 INFO L87 Difference]: Start difference. First operand 411 states and 591 transitions. Second operand has 26 states, 26 states have (on average 8.692307692307692) internal successors, (226), 26 states have internal predecessors, (226), 7 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 7 states have call successors, (161) [2025-02-06 02:19:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:58,173 INFO L93 Difference]: Finished difference Result 787 states and 1103 transitions. [2025-02-06 02:19:58,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 02:19:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.692307692307692) internal successors, (226), 26 states have internal predecessors, (226), 7 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 7 states have call successors, (161) Word has length 374 [2025-02-06 02:19:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:58,177 INFO L225 Difference]: With dead ends: 787 [2025-02-06 02:19:58,177 INFO L226 Difference]: Without dead ends: 516 [2025-02-06 02:19:58,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 741 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=508, Invalid=1384, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 02:19:58,179 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 1481 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:58,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1322 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:19:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-06 02:19:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 443. [2025-02-06 02:19:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 301 states have (on average 1.2591362126245846) internal successors, (379), 302 states have internal predecessors, (379), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 02:19:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 613 transitions. [2025-02-06 02:19:58,210 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 613 transitions. Word has length 374 [2025-02-06 02:19:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:58,211 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 613 transitions. [2025-02-06 02:19:58,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.692307692307692) internal successors, (226), 26 states have internal predecessors, (226), 7 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 7 states have call successors, (161) [2025-02-06 02:19:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 613 transitions. [2025-02-06 02:19:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-06 02:19:58,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:58,213 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:58,221 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:19:58,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:58,417 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:58,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1537080001, now seen corresponding path program 1 times [2025-02-06 02:19:58,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:58,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644516877] [2025-02-06 02:19:58,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:58,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:58,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:19:58,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:19:58,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:58,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:19:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644516877] [2025-02-06 02:19:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644516877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:58,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:58,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:19:58,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641767029] [2025-02-06 02:19:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:58,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:19:58,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:58,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:19:58,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:58,577 INFO L87 Difference]: Start difference. First operand 443 states and 613 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:58,846 INFO L93 Difference]: Finished difference Result 888 states and 1249 transitions. [2025-02-06 02:19:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:19:58,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2025-02-06 02:19:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:58,850 INFO L225 Difference]: With dead ends: 888 [2025-02-06 02:19:58,850 INFO L226 Difference]: Without dead ends: 597 [2025-02-06 02:19:58,851 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:19:58,852 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 235 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:58,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1039 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:19:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-06 02:19:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 475. [2025-02-06 02:19:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 334 states have internal predecessors, (428), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 02:19:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 662 transitions. [2025-02-06 02:19:58,891 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 662 transitions. Word has length 374 [2025-02-06 02:19:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:58,891 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 662 transitions. [2025-02-06 02:19:58,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 662 transitions. [2025-02-06 02:19:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-06 02:19:58,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:58,894 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:58,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:19:58,894 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:58,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1535737592, now seen corresponding path program 1 times [2025-02-06 02:19:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128146221] [2025-02-06 02:19:58,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:58,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:58,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:19:58,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:19:58,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:58,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:19:58,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:58,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128146221] [2025-02-06 02:19:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128146221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:58,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:58,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:19:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597728048] [2025-02-06 02:19:58,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:58,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:19:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:58,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:19:58,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:19:58,993 INFO L87 Difference]: Start difference. First operand 475 states and 662 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:59,086 INFO L93 Difference]: Finished difference Result 1102 states and 1542 transitions. [2025-02-06 02:19:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:19:59,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2025-02-06 02:19:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:59,091 INFO L225 Difference]: With dead ends: 1102 [2025-02-06 02:19:59,091 INFO L226 Difference]: Without dead ends: 795 [2025-02-06 02:19:59,092 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:19:59,092 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 236 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:59,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 514 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:19:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-06 02:19:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 585. [2025-02-06 02:19:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 443 states have (on average 1.329571106094808) internal successors, (589), 444 states have internal predecessors, (589), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 02:19:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 823 transitions. [2025-02-06 02:19:59,134 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 823 transitions. Word has length 375 [2025-02-06 02:19:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:59,134 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 823 transitions. [2025-02-06 02:19:59,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:19:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 823 transitions. [2025-02-06 02:19:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-06 02:19:59,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:59,136 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:59,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:19:59,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:59,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1790474137, now seen corresponding path program 1 times [2025-02-06 02:19:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:59,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803444586] [2025-02-06 02:19:59,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:59,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:59,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:19:59,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:19:59,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:59,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:20:00,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:00,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803444586] [2025-02-06 02:20:00,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803444586] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:20:00,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219988427] [2025-02-06 02:20:00,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:00,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:00,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:00,099 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:20:00,102 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:20:00,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:20:00,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:20:00,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:00,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:00,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 02:20:00,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1065 proven. 150 refuted. 0 times theorem prover too weak. 4945 trivial. 0 not checked. [2025-02-06 02:20:00,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:20:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:20:01,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219988427] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:20:01,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:20:01,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-06 02:20:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311024803] [2025-02-06 02:20:01,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:20:01,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:20:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:01,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:20:01,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:20:01,384 INFO L87 Difference]: Start difference. First operand 585 states and 823 transitions. Second operand has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 3 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (157), 3 states have call predecessors, (157), 3 states have call successors, (157) [2025-02-06 02:20:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:02,046 INFO L93 Difference]: Finished difference Result 975 states and 1359 transitions. [2025-02-06 02:20:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:20:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 3 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (157), 3 states have call predecessors, (157), 3 states have call successors, (157) Word has length 375 [2025-02-06 02:20:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:02,051 INFO L225 Difference]: With dead ends: 975 [2025-02-06 02:20:02,051 INFO L226 Difference]: Without dead ends: 612 [2025-02-06 02:20:02,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 745 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:20:02,053 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 422 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:02,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 884 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:20:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-06 02:20:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 593. [2025-02-06 02:20:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 449 states have (on average 1.3207126948775056) internal successors, (593), 450 states have internal predecessors, (593), 117 states have call successors, (117), 26 states have call predecessors, (117), 26 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 02:20:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 827 transitions. [2025-02-06 02:20:02,097 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 827 transitions. Word has length 375 [2025-02-06 02:20:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:02,099 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 827 transitions. [2025-02-06 02:20:02,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 3 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (157), 3 states have call predecessors, (157), 3 states have call successors, (157) [2025-02-06 02:20:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 827 transitions. [2025-02-06 02:20:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-06 02:20:02,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:02,101 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:02,113 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:20:02,302 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,SelfDestructingSolverStorable12 [2025-02-06 02:20:02,303 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:02,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:02,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1759454330, now seen corresponding path program 1 times [2025-02-06 02:20:02,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:02,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725369264] [2025-02-06 02:20:02,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:02,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:20:02,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:20:02,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:02,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:20:02,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096240808] [2025-02-06 02:20:02,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:02,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:02,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:02,623 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:20:02,625 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:20:02,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:20:02,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:20:02,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:02,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:02,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 02:20:02,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3963 proven. 270 refuted. 0 times theorem prover too weak. 1927 trivial. 0 not checked. [2025-02-06 02:20:04,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:20:04,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:04,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725369264] [2025-02-06 02:20:04,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 02:20:04,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096240808] [2025-02-06 02:20:04,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096240808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:20:04,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:20:04,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-02-06 02:20:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698333972] [2025-02-06 02:20:04,579 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 02:20:04,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:20:04,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:04,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:20:04,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:20:04,581 INFO L87 Difference]: Start difference. First operand 593 states and 827 transitions. Second operand has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-02-06 02:20:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:05,275 INFO L93 Difference]: Finished difference Result 1695 states and 2372 transitions. [2025-02-06 02:20:05,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:20:05,275 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 375 [2025-02-06 02:20:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:05,282 INFO L225 Difference]: With dead ends: 1695 [2025-02-06 02:20:05,282 INFO L226 Difference]: Without dead ends: 1260 [2025-02-06 02:20:05,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2025-02-06 02:20:05,284 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 395 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:05,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1503 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:20:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2025-02-06 02:20:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1046. [2025-02-06 02:20:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 823 states have (on average 1.330498177399757) internal successors, (1095), 825 states have internal predecessors, (1095), 178 states have call successors, (178), 44 states have call predecessors, (178), 44 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2025-02-06 02:20:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1451 transitions. [2025-02-06 02:20:05,384 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1451 transitions. Word has length 375 [2025-02-06 02:20:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:05,385 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1451 transitions. [2025-02-06 02:20:05,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-02-06 02:20:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1451 transitions. [2025-02-06 02:20:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-06 02:20:05,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:05,387 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:05,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 02:20:05,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 02:20:05,587 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:05,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1999994459, now seen corresponding path program 1 times [2025-02-06 02:20:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18995207] [2025-02-06 02:20:05,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:05,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:20:06,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:20:06,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:06,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:20:06,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319633962] [2025-02-06 02:20:06,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:06,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:06,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:06,033 INFO L229 MonitoredProcess]: Starting monitored process 7 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:20:06,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 02:20:06,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:20:06,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:20:06,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:06,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:06,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 02:20:06,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4092 proven. 144 refuted. 0 times theorem prover too weak. 1924 trivial. 0 not checked. [2025-02-06 02:20:07,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:20:11,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_58~0 65536)) (.cse4 (mod c_~var_1_35~0 256))) (let ((.cse2 (< .cse1 .cse4)) (.cse3 (< .cse4 (+ .cse1 1))) (.cse0 (mod c_~var_1_7~0 4294967296))) (and (or (and (or (< (mod (div .cse0 .cse1) 4294967296) 1) .cse2) (or .cse3 (< (div .cse0 .cse4) 1))) (< 4294967294 .cse0)) (or (forall ((v_z_38 Int)) (or (< .cse0 v_z_38) (< (mod (div v_z_38 .cse1) 4294967296) 1) (< v_z_38 0))) .cse2) (or .cse3 (forall ((v_z_38 Int)) (or (< .cse0 v_z_38) (< v_z_38 0) (< (div v_z_38 .cse4) 1))))))) is different from false [2025-02-06 02:20:16,443 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_35~0 256)) (.cse3 (mod c_~var_1_58~0 65536))) (let ((.cse2 (< .cse1 (+ .cse3 1))) (.cse0 (mod c_~var_1_7~0 4294967296)) (.cse4 (< .cse3 .cse1))) (and (or (forall ((v_z_38 Int)) (or (< .cse0 v_z_38) (< (div v_z_38 .cse1) 1))) .cse2) (or (and (or (< (mod (div .cse0 .cse3) 4294967296) 1) .cse4) (or .cse2 (< (div .cse0 .cse1) 1))) (< 4294967294 .cse0)) (or (forall ((v_z_38 Int)) (or (< .cse0 v_z_38) (< (mod (div v_z_38 .cse3) 4294967296) 1) (< v_z_38 0))) .cse4)))) is different from false [2025-02-06 02:20:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:20:36,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:36,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18995207] [2025-02-06 02:20:36,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 02:20:36,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319633962] [2025-02-06 02:20:36,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319633962] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:20:36,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:20:36,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2025-02-06 02:20:36,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002560338] [2025-02-06 02:20:36,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:20:36,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 02:20:36,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:36,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 02:20:36,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=179, Unknown=2, NotChecked=58, Total=306 [2025-02-06 02:20:36,146 INFO L87 Difference]: Start difference. First operand 1046 states and 1451 transitions. Second operand has 18 states, 18 states have (on average 9.833333333333334) internal successors, (177), 18 states have internal predecessors, (177), 4 states have call successors, (91), 3 states have call predecessors, (91), 6 states have return successors, (92), 4 states have call predecessors, (92), 4 states have call successors, (92) [2025-02-06 02:20:41,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-02-06 02:20:46,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-02-06 02:21:09,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]