./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-8.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-8.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 8756b08be05a2754ba7f473b23db96aacdd088f16a43249dcd482c532b48d535 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:21:55,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:21:56,025 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:21:56,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:21:56,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:21:56,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:21:56,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:21:56,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:21:56,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:21:56,061 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:21:56,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:21:56,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:21:56,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:21:56,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:21:56,063 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:21:56,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:21:56,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:21:56,063 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:21:56,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:21:56,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:21:56,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:21:56,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:21:56,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:21:56,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:21:56,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:21:56,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:21:56,064 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:21:56,064 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:21:56,064 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:21:56,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:21:56,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:21:56,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:21:56,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:21:56,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:21:56,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:21:56,066 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:21:56,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:21:56,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:21:56,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:21:56,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:21:56,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:21:56,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:21:56,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:21:56,066 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 -> 8756b08be05a2754ba7f473b23db96aacdd088f16a43249dcd482c532b48d535 [2025-02-06 02:21:56,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:21:56,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:21:56,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:21:56,329 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:21:56,330 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:21:56,331 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-8.i [2025-02-06 02:21:57,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9788438f/e620c958fc8a44348741d279b578c82e/FLAGc09ef170b [2025-02-06 02:21:57,774 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:21:57,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-8.i [2025-02-06 02:21:57,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9788438f/e620c958fc8a44348741d279b578c82e/FLAGc09ef170b [2025-02-06 02:21:57,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9788438f/e620c958fc8a44348741d279b578c82e [2025-02-06 02:21:57,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:21:57,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:21:57,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:21:57,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:21:57,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:21:57,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:21:57" (1/1) ... [2025-02-06 02:21:57,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c8d6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:57, skipping insertion in model container [2025-02-06 02:21:57,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:21:57" (1/1) ... [2025-02-06 02:21:57,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:21:57,955 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-8.i[915,928] [2025-02-06 02:21:58,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:21:58,076 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:21:58,083 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-8.i[915,928] [2025-02-06 02:21:58,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:21:58,158 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:21:58,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58 WrapperNode [2025-02-06 02:21:58,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:21:58,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:21:58,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:21:58,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:21:58,166 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:21:58" (1/1) ... [2025-02-06 02:21:58,177 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:21:58" (1/1) ... [2025-02-06 02:21:58,226 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 394 [2025-02-06 02:21:58,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:21:58,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:21:58,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:21:58,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:21:58,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,276 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:21:58,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:21:58,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:21:58,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:21:58,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:21:58,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (1/1) ... [2025-02-06 02:21:58,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:21:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:21:58,355 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:21:58,360 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:21:58,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:21:58,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:21:58,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:21:58,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:21:58,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:21:58,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:21:58,442 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:21:58,443 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:21:58,998 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~ite36#1;havoc property_#t~bitwise35#1;havoc property_#t~short37#1; [2025-02-06 02:21:59,042 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-02-06 02:21:59,042 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:21:59,055 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:21:59,056 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:21:59,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:21:59 BoogieIcfgContainer [2025-02-06 02:21:59,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:21:59,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:21:59,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:21:59,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:21:59,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:21:57" (1/3) ... [2025-02-06 02:21:59,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167281d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:21:59, skipping insertion in model container [2025-02-06 02:21:59,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:58" (2/3) ... [2025-02-06 02:21:59,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167281d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:21:59, skipping insertion in model container [2025-02-06 02:21:59,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:21:59" (3/3) ... [2025-02-06 02:21:59,063 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-8.i [2025-02-06 02:21:59,073 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:21:59,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-8.i that has 2 procedures, 173 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:21:59,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:21:59,121 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;@7145d798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:21:59,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:21:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 121 states have internal predecessors, (182), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 02:21:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-06 02:21:59,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:21:59,136 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:59,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:21:59,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:21:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1256873159, now seen corresponding path program 1 times [2025-02-06 02:21:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:21:59,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026430280] [2025-02-06 02:21:59,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:21:59,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:21:59,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:21:59,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:59,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-02-06 02:21:59,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:21:59,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026430280] [2025-02-06 02:21:59,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026430280] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:21:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251532565] [2025-02-06 02:21:59,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:21:59,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:21:59,549 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:21:59,550 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:21:59,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:21:59,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:21:59,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:59,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:59,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:21:59,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:21:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-02-06 02:21:59,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:21:59,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251532565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:21:59,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:21:59,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:21:59,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728748062] [2025-02-06 02:21:59,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:21:59,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:21:59,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:21:59,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:21:59,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:21:59,842 INFO L87 Difference]: Start difference. First operand has 173 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 121 states have internal predecessors, (182), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:21:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:21:59,884 INFO L93 Difference]: Finished difference Result 340 states and 609 transitions. [2025-02-06 02:21:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:21:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 327 [2025-02-06 02:21:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:21:59,891 INFO L225 Difference]: With dead ends: 340 [2025-02-06 02:21:59,891 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 02:21:59,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 328 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:21:59,895 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:21:59,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:21:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 02:21:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-06 02:21:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.5) internal successors, (177), 118 states have internal predecessors, (177), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 02:21:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 277 transitions. [2025-02-06 02:21:59,941 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 277 transitions. Word has length 327 [2025-02-06 02:21:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:21:59,941 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 277 transitions. [2025-02-06 02:21:59,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:21:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 277 transitions. [2025-02-06 02:21:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-06 02:21:59,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:21:59,947 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:59,955 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:22:00,147 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:22:00,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:00,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash -846313579, now seen corresponding path program 1 times [2025-02-06 02:22:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:00,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695298187] [2025-02-06 02:22:00,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:00,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:22:00,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:22:00,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:00,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:22:00,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695298187] [2025-02-06 02:22:00,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695298187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:22:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432645101] [2025-02-06 02:22:00,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:00,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:22:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:00,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:22:00,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:22:00,426 INFO L87 Difference]: Start difference. First operand 170 states and 277 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:22:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:00,603 INFO L93 Difference]: Finished difference Result 491 states and 799 transitions. [2025-02-06 02:22:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:22:00,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 327 [2025-02-06 02:22:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:00,608 INFO L225 Difference]: With dead ends: 491 [2025-02-06 02:22:00,611 INFO L226 Difference]: Without dead ends: 324 [2025-02-06 02:22:00,612 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:22:00,613 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 242 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:00,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 700 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:22:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-02-06 02:22:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2025-02-06 02:22:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 219 states have (on average 1.4246575342465753) internal successors, (312), 219 states have internal predecessors, (312), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 02:22:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 512 transitions. [2025-02-06 02:22:00,661 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 512 transitions. Word has length 327 [2025-02-06 02:22:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:00,662 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 512 transitions. [2025-02-06 02:22:00,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:22:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 512 transitions. [2025-02-06 02:22:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-06 02:22:00,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:00,669 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:00,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:22:00,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:00,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1650517416, now seen corresponding path program 1 times [2025-02-06 02:22:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:00,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364234049] [2025-02-06 02:22:00,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:00,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:22:00,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:22:00,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:00,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:22:01,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:01,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364234049] [2025-02-06 02:22:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364234049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:01,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:01,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:22:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547853328] [2025-02-06 02:22:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:01,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:22:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:01,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:22:01,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:22:01,490 INFO L87 Difference]: Start difference. First operand 322 states and 512 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:22:01,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:01,612 INFO L93 Difference]: Finished difference Result 894 states and 1420 transitions. [2025-02-06 02:22:01,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:22:01,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 327 [2025-02-06 02:22:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:01,620 INFO L225 Difference]: With dead ends: 894 [2025-02-06 02:22:01,621 INFO L226 Difference]: Without dead ends: 575 [2025-02-06 02:22:01,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:22:01,624 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 259 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:01,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 667 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:22:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-06 02:22:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 377. [2025-02-06 02:22:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 274 states have (on average 1.448905109489051) internal successors, (397), 274 states have internal predecessors, (397), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 02:22:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 597 transitions. [2025-02-06 02:22:01,680 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 597 transitions. Word has length 327 [2025-02-06 02:22:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:01,682 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 597 transitions. [2025-02-06 02:22:01,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:22:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 597 transitions. [2025-02-06 02:22:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-06 02:22:01,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:01,687 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:01,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:22:01,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:01,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash 487348931, now seen corresponding path program 1 times [2025-02-06 02:22:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:01,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133397737] [2025-02-06 02:22:01,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:01,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-06 02:22:01,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-06 02:22:01,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:01,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:22:02,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:02,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133397737] [2025-02-06 02:22:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133397737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:02,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:02,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:22:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599923272] [2025-02-06 02:22:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:02,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:22:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:02,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:22:02,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:22:02,278 INFO L87 Difference]: Start difference. First operand 377 states and 597 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:22:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:02,477 INFO L93 Difference]: Finished difference Result 1069 states and 1695 transitions. [2025-02-06 02:22:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:22:02,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 328 [2025-02-06 02:22:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:02,485 INFO L225 Difference]: With dead ends: 1069 [2025-02-06 02:22:02,487 INFO L226 Difference]: Without dead ends: 695 [2025-02-06 02:22:02,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:22:02,491 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 201 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:02,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 724 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:22:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-02-06 02:22:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 681. [2025-02-06 02:22:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 476 states have (on average 1.4285714285714286) internal successors, (680), 476 states have internal predecessors, (680), 200 states have call successors, (200), 4 states have call predecessors, (200), 4 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2025-02-06 02:22:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1080 transitions. [2025-02-06 02:22:02,562 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1080 transitions. Word has length 328 [2025-02-06 02:22:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:02,565 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1080 transitions. [2025-02-06 02:22:02,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:22:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1080 transitions. [2025-02-06 02:22:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-06 02:22:02,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:02,569 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:02,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:22:02,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:02,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:02,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1589860412, now seen corresponding path program 1 times [2025-02-06 02:22:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:02,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662651147] [2025-02-06 02:22:02,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:02,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:02,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-06 02:22:02,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-06 02:22:02,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:02,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:22:05,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:05,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662651147] [2025-02-06 02:22:05,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662651147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:05,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:05,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 02:22:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193897694] [2025-02-06 02:22:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:05,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:22:05,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:05,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:22:05,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:22:05,378 INFO L87 Difference]: Start difference. First operand 681 states and 1080 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 3 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-02-06 02:22:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:08,269 INFO L93 Difference]: Finished difference Result 3238 states and 5075 transitions. [2025-02-06 02:22:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 02:22:08,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 3 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 328 [2025-02-06 02:22:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:08,287 INFO L225 Difference]: With dead ends: 3238 [2025-02-06 02:22:08,287 INFO L226 Difference]: Without dead ends: 2560 [2025-02-06 02:22:08,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2025-02-06 02:22:08,293 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 1584 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:08,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 1877 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 02:22:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2025-02-06 02:22:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 1888. [2025-02-06 02:22:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1375 states have (on average 1.4334545454545455) internal successors, (1971), 1379 states have internal predecessors, (1971), 500 states have call successors, (500), 12 states have call predecessors, (500), 12 states have return successors, (500), 496 states have call predecessors, (500), 500 states have call successors, (500) [2025-02-06 02:22:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2971 transitions. [2025-02-06 02:22:08,504 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2971 transitions. Word has length 328 [2025-02-06 02:22:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:08,506 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2971 transitions. [2025-02-06 02:22:08,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 3 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-02-06 02:22:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2971 transitions. [2025-02-06 02:22:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-06 02:22:08,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:08,515 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:08,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:22:08,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:08,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1460777693, now seen corresponding path program 1 times [2025-02-06 02:22:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:08,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775788054] [2025-02-06 02:22:08,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:08,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-06 02:22:08,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-06 02:22:08,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:08,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 63 proven. 84 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-02-06 02:22:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775788054] [2025-02-06 02:22:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775788054] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533639805] [2025-02-06 02:22:09,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:09,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:09,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:22:09,352 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:22:09,354 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:22:09,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-06 02:22:09,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-06 02:22:09,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:09,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:09,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 02:22:09,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:22:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2443 proven. 84 refuted. 0 times theorem prover too weak. 2373 trivial. 0 not checked. [2025-02-06 02:22:10,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:22:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 63 proven. 84 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-02-06 02:22:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533639805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:22:10,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:22:10,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 21 [2025-02-06 02:22:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661480981] [2025-02-06 02:22:10,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:22:10,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 02:22:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:10,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 02:22:10,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:22:10,719 INFO L87 Difference]: Start difference. First operand 1888 states and 2971 transitions. Second operand has 21 states, 20 states have (on average 10.1) internal successors, (202), 21 states have internal predecessors, (202), 7 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 6 states have call predecessors, (150), 7 states have call successors, (150) [2025-02-06 02:22:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:14,127 INFO L93 Difference]: Finished difference Result 6609 states and 10197 transitions. [2025-02-06 02:22:14,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-06 02:22:14,128 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 10.1) internal successors, (202), 21 states have internal predecessors, (202), 7 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 6 states have call predecessors, (150), 7 states have call successors, (150) Word has length 328 [2025-02-06 02:22:14,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:14,157 INFO L225 Difference]: With dead ends: 6609 [2025-02-06 02:22:14,157 INFO L226 Difference]: Without dead ends: 4724 [2025-02-06 02:22:14,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=802, Invalid=2980, Unknown=0, NotChecked=0, Total=3782 [2025-02-06 02:22:14,167 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 1773 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 3090 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 3090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:14,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 3328 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 3090 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 02:22:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2025-02-06 02:22:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 2989. [2025-02-06 02:22:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2158 states have (on average 1.40129749768304) internal successors, (3024), 2166 states have internal predecessors, (3024), 784 states have call successors, (784), 46 states have call predecessors, (784), 46 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-02-06 02:22:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4592 transitions. [2025-02-06 02:22:14,412 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4592 transitions. Word has length 328 [2025-02-06 02:22:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:14,412 INFO L471 AbstractCegarLoop]: Abstraction has 2989 states and 4592 transitions. [2025-02-06 02:22:14,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 10.1) internal successors, (202), 21 states have internal predecessors, (202), 7 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 6 states have call predecessors, (150), 7 states have call successors, (150) [2025-02-06 02:22:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4592 transitions. [2025-02-06 02:22:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-02-06 02:22:14,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:14,417 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:22:14,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:14,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:14,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash -512978778, now seen corresponding path program 1 times [2025-02-06 02:22:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890206985] [2025-02-06 02:22:14,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:14,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-02-06 02:22:14,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-02-06 02:22:14,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:14,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:22:14,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:14,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890206985] [2025-02-06 02:22:14,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890206985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:14,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:14,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:22:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386956095] [2025-02-06 02:22:14,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:14,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:22:14,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:14,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:22:14,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:22:14,912 INFO L87 Difference]: Start difference. First operand 2989 states and 4592 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:22:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:15,200 INFO L93 Difference]: Finished difference Result 6829 states and 10485 transitions. [2025-02-06 02:22:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:22:15,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 330 [2025-02-06 02:22:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:15,225 INFO L225 Difference]: With dead ends: 6829 [2025-02-06 02:22:15,225 INFO L226 Difference]: Without dead ends: 3843 [2025-02-06 02:22:15,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:22:15,235 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 153 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:15,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 535 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:22:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2025-02-06 02:22:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3841. [2025-02-06 02:22:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3841 states, 2742 states have (on average 1.37381473377097) internal successors, (3767), 2752 states have internal predecessors, (3767), 1034 states have call successors, (1034), 64 states have call predecessors, (1034), 64 states have return successors, (1034), 1024 states have call predecessors, (1034), 1034 states have call successors, (1034) [2025-02-06 02:22:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5835 transitions. [2025-02-06 02:22:15,514 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5835 transitions. Word has length 330 [2025-02-06 02:22:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:15,516 INFO L471 AbstractCegarLoop]: Abstraction has 3841 states and 5835 transitions. [2025-02-06 02:22:15,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:22:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5835 transitions. [2025-02-06 02:22:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-06 02:22:15,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:15,520 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:15,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:22:15,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:15,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:15,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2020600530, now seen corresponding path program 1 times [2025-02-06 02:22:15,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:15,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836557739] [2025-02-06 02:22:15,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:15,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-06 02:22:15,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-06 02:22:15,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:15,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:22:15,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836557739] [2025-02-06 02:22:15,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836557739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:15,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:15,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:22:15,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101423134] [2025-02-06 02:22:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:15,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:22:15,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:15,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:22:15,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:22:15,746 INFO L87 Difference]: Start difference. First operand 3841 states and 5835 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:22:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:16,197 INFO L93 Difference]: Finished difference Result 6829 states and 10425 transitions. [2025-02-06 02:22:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:22:16,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 331 [2025-02-06 02:22:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:16,219 INFO L225 Difference]: With dead ends: 6829 [2025-02-06 02:22:16,219 INFO L226 Difference]: Without dead ends: 3843 [2025-02-06 02:22:16,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:22:16,227 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 230 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:16,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1016 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:22:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2025-02-06 02:22:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3841. [2025-02-06 02:22:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3841 states, 2742 states have (on average 1.3676148796498906) internal successors, (3750), 2752 states have internal predecessors, (3750), 1034 states have call successors, (1034), 64 states have call predecessors, (1034), 64 states have return successors, (1034), 1024 states have call predecessors, (1034), 1034 states have call successors, (1034) [2025-02-06 02:22:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5818 transitions. [2025-02-06 02:22:16,515 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5818 transitions. Word has length 331 [2025-02-06 02:22:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:16,516 INFO L471 AbstractCegarLoop]: Abstraction has 3841 states and 5818 transitions. [2025-02-06 02:22:16,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:22:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5818 transitions. [2025-02-06 02:22:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-06 02:22:16,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:16,526 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:16,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:22:16,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:16,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 818197115, now seen corresponding path program 1 times [2025-02-06 02:22:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:16,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779218659] [2025-02-06 02:22:16,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:16,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-06 02:22:16,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-06 02:22:16,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:16,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 87 proven. 60 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-02-06 02:22:18,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779218659] [2025-02-06 02:22:18,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779218659] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243059385] [2025-02-06 02:22:18,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:22:18,652 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:22:18,653 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:22:18,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-06 02:22:18,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-06 02:22:18,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:18,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:18,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 02:22:18,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:22:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3105 proven. 249 refuted. 0 times theorem prover too weak. 1546 trivial. 0 not checked. [2025-02-06 02:22:21,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:22:26,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243059385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:26,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:22:26,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20] total 29 [2025-02-06 02:22:26,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002082457] [2025-02-06 02:22:26,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:22:26,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 02:22:26,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:26,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 02:22:26,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 02:22:26,136 INFO L87 Difference]: Start difference. First operand 3841 states and 5818 transitions. Second operand has 29 states, 29 states have (on average 6.448275862068965) internal successors, (187), 27 states have internal predecessors, (187), 10 states have call successors, (100), 7 states have call predecessors, (100), 11 states have return successors, (100), 10 states have call predecessors, (100), 10 states have call successors, (100) [2025-02-06 02:22:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:31,760 INFO L93 Difference]: Finished difference Result 9817 states and 14682 transitions. [2025-02-06 02:22:31,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-02-06 02:22:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.448275862068965) internal successors, (187), 27 states have internal predecessors, (187), 10 states have call successors, (100), 7 states have call predecessors, (100), 11 states have return successors, (100), 10 states have call predecessors, (100), 10 states have call successors, (100) Word has length 331 [2025-02-06 02:22:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:31,797 INFO L225 Difference]: With dead ends: 9817 [2025-02-06 02:22:31,798 INFO L226 Difference]: Without dead ends: 5979 [2025-02-06 02:22:31,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 480 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3644 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2574, Invalid=8556, Unknown=0, NotChecked=0, Total=11130 [2025-02-06 02:22:31,811 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 2722 mSDsluCounter, 2939 mSDsCounter, 0 mSdLazyCounter, 4048 mSolverCounterSat, 1179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2826 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 5227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1179 IncrementalHoareTripleChecker+Valid, 4048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:31,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2826 Valid, 3202 Invalid, 5227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1179 Valid, 4048 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-06 02:22:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2025-02-06 02:22:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 5287. [2025-02-06 02:22:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5287 states, 3844 states have (on average 1.3712278876170656) internal successors, (5271), 3866 states have internal predecessors, (5271), 1346 states have call successors, (1346), 96 states have call predecessors, (1346), 96 states have return successors, (1346), 1324 states have call predecessors, (1346), 1346 states have call successors, (1346) [2025-02-06 02:22:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5287 states to 5287 states and 7963 transitions. [2025-02-06 02:22:32,287 INFO L78 Accepts]: Start accepts. Automaton has 5287 states and 7963 transitions. Word has length 331 [2025-02-06 02:22:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:32,289 INFO L471 AbstractCegarLoop]: Abstraction has 5287 states and 7963 transitions. [2025-02-06 02:22:32,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.448275862068965) internal successors, (187), 27 states have internal predecessors, (187), 10 states have call successors, (100), 7 states have call predecessors, (100), 11 states have return successors, (100), 10 states have call predecessors, (100), 10 states have call successors, (100) [2025-02-06 02:22:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5287 states and 7963 transitions. [2025-02-06 02:22:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-06 02:22:32,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:32,294 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:32,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:22:32,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:32,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:32,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:32,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1342121257, now seen corresponding path program 1 times [2025-02-06 02:22:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:32,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199311156] [2025-02-06 02:22:32,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:32,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:32,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-06 02:22:32,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-06 02:22:32,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:32,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:22:32,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:32,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199311156] [2025-02-06 02:22:32,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199311156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:32,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:32,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:22:32,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211810098] [2025-02-06 02:22:32,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:32,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:22:32,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:32,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:22:32,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:22:32,970 INFO L87 Difference]: Start difference. First operand 5287 states and 7963 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:22:34,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:34,751 INFO L93 Difference]: Finished difference Result 10073 states and 15061 transitions. [2025-02-06 02:22:34,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:22:34,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 332 [2025-02-06 02:22:34,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:34,790 INFO L225 Difference]: With dead ends: 10073 [2025-02-06 02:22:34,790 INFO L226 Difference]: Without dead ends: 8516 [2025-02-06 02:22:34,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:22:34,797 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 755 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:34,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1290 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:22:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8516 states. [2025-02-06 02:22:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8516 to 6235. [2025-02-06 02:22:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6235 states, 4628 states have (on average 1.3755401901469317) internal successors, (6366), 4657 states have internal predecessors, (6366), 1469 states have call successors, (1469), 137 states have call predecessors, (1469), 137 states have return successors, (1469), 1440 states have call predecessors, (1469), 1469 states have call successors, (1469) [2025-02-06 02:22:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6235 states to 6235 states and 9304 transitions. [2025-02-06 02:22:35,553 INFO L78 Accepts]: Start accepts. Automaton has 6235 states and 9304 transitions. Word has length 332 [2025-02-06 02:22:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:35,554 INFO L471 AbstractCegarLoop]: Abstraction has 6235 states and 9304 transitions. [2025-02-06 02:22:35,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:22:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6235 states and 9304 transitions. [2025-02-06 02:22:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-06 02:22:35,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:35,560 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:35,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:22:35,560 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:35,561 INFO L85 PathProgramCache]: Analyzing trace with hash -841555670, now seen corresponding path program 1 times [2025-02-06 02:22:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868199483] [2025-02-06 02:22:35,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:35,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-06 02:22:35,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-06 02:22:35,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:35,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:22:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:36,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868199483] [2025-02-06 02:22:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868199483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:36,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:36,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:22:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539231363] [2025-02-06 02:22:36,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:36,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:22:36,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:36,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:22:36,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:22:36,053 INFO L87 Difference]: Start difference. First operand 6235 states and 9304 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:22:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:38,201 INFO L93 Difference]: Finished difference Result 12662 states and 18874 transitions. [2025-02-06 02:22:38,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:22:38,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 332 [2025-02-06 02:22:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:38,243 INFO L225 Difference]: With dead ends: 12662 [2025-02-06 02:22:38,243 INFO L226 Difference]: Without dead ends: 11005 [2025-02-06 02:22:38,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:22:38,251 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 830 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:38,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1124 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:22:38,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11005 states. [2025-02-06 02:22:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11005 to 6237. [2025-02-06 02:22:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6237 states, 4630 states have (on average 1.375377969762419) internal successors, (6368), 4659 states have internal predecessors, (6368), 1469 states have call successors, (1469), 137 states have call predecessors, (1469), 137 states have return successors, (1469), 1440 states have call predecessors, (1469), 1469 states have call successors, (1469) [2025-02-06 02:22:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6237 states to 6237 states and 9306 transitions. [2025-02-06 02:22:38,953 INFO L78 Accepts]: Start accepts. Automaton has 6237 states and 9306 transitions. Word has length 332 [2025-02-06 02:22:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:38,954 INFO L471 AbstractCegarLoop]: Abstraction has 6237 states and 9306 transitions. [2025-02-06 02:22:38,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:22:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6237 states and 9306 transitions. [2025-02-06 02:22:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-06 02:22:38,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:38,958 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:38,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:22:38,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:38,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:38,959 INFO L85 PathProgramCache]: Analyzing trace with hash -810535863, now seen corresponding path program 1 times [2025-02-06 02:22:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:38,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641482833] [2025-02-06 02:22:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:38,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-06 02:22:39,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-06 02:22:39,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:39,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:22:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:39,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641482833] [2025-02-06 02:22:39,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641482833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:39,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:22:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636014200] [2025-02-06 02:22:39,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:39,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:22:39,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:39,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:22:39,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:22:39,321 INFO L87 Difference]: Start difference. First operand 6237 states and 9306 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:22:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:41,270 INFO L93 Difference]: Finished difference Result 8896 states and 13273 transitions. [2025-02-06 02:22:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:22:41,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 332 [2025-02-06 02:22:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:41,320 INFO L225 Difference]: With dead ends: 8896 [2025-02-06 02:22:41,320 INFO L226 Difference]: Without dead ends: 7237 [2025-02-06 02:22:41,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:22:41,334 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 625 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:41,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1352 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:22:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7237 states. [2025-02-06 02:22:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7237 to 6085. [2025-02-06 02:22:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 4478 states have (on average 1.3671281822242072) internal successors, (6122), 4507 states have internal predecessors, (6122), 1469 states have call successors, (1469), 137 states have call predecessors, (1469), 137 states have return successors, (1469), 1440 states have call predecessors, (1469), 1469 states have call successors, (1469) [2025-02-06 02:22:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 9060 transitions. [2025-02-06 02:22:42,048 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 9060 transitions. Word has length 332 [2025-02-06 02:22:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:42,049 INFO L471 AbstractCegarLoop]: Abstraction has 6085 states and 9060 transitions. [2025-02-06 02:22:42,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:22:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 9060 transitions. [2025-02-06 02:22:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-06 02:22:42,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:42,053 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:42,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:22:42,053 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:42,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2029771435, now seen corresponding path program 1 times [2025-02-06 02:22:42,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:42,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712372951] [2025-02-06 02:22:42,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:42,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:42,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-06 02:22:42,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-06 02:22:42,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:42,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 315 proven. 108 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2025-02-06 02:22:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712372951] [2025-02-06 02:22:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712372951] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617003239] [2025-02-06 02:22:43,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:43,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:22:43,695 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:22:43,716 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:22:43,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-06 02:22:43,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-06 02:22:43,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:43,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:43,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 02:22:43,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:22:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2929 proven. 156 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2025-02-06 02:22:44,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:22:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 267 proven. 165 refuted. 0 times theorem prover too weak. 4468 trivial. 0 not checked. [2025-02-06 02:22:45,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617003239] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:22:45,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:22:45,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2025-02-06 02:22:45,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387782967] [2025-02-06 02:22:45,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:22:45,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 02:22:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:45,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 02:22:45,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2025-02-06 02:22:45,453 INFO L87 Difference]: Start difference. First operand 6085 states and 9060 transitions. Second operand has 32 states, 31 states have (on average 7.129032258064516) internal successors, (221), 30 states have internal predecessors, (221), 12 states have call successors, (122), 4 states have call predecessors, (122), 9 states have return successors, (123), 12 states have call predecessors, (123), 12 states have call successors, (123) [2025-02-06 02:22:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:54,535 INFO L93 Difference]: Finished difference Result 22818 states and 33229 transitions. [2025-02-06 02:22:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-02-06 02:22:54,536 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 7.129032258064516) internal successors, (221), 30 states have internal predecessors, (221), 12 states have call successors, (122), 4 states have call predecessors, (122), 9 states have return successors, (123), 12 states have call predecessors, (123), 12 states have call successors, (123) Word has length 332 [2025-02-06 02:22:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:54,625 INFO L225 Difference]: With dead ends: 22818 [2025-02-06 02:22:54,626 INFO L226 Difference]: Without dead ends: 19796 [2025-02-06 02:22:54,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8113 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4333, Invalid=16547, Unknown=0, NotChecked=0, Total=20880 [2025-02-06 02:22:54,649 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 5167 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 3166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5194 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 6125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3166 IncrementalHoareTripleChecker+Valid, 2959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:54,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5194 Valid, 2586 Invalid, 6125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3166 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 02:22:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19796 states. [2025-02-06 02:22:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19796 to 15090. [2025-02-06 02:22:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15090 states, 11154 states have (on average 1.3644432490586336) internal successors, (15219), 11259 states have internal predecessors, (15219), 3491 states have call successors, (3491), 444 states have call predecessors, (3491), 444 states have return successors, (3491), 3386 states have call predecessors, (3491), 3491 states have call successors, (3491) [2025-02-06 02:22:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15090 states to 15090 states and 22201 transitions. [2025-02-06 02:22:56,838 INFO L78 Accepts]: Start accepts. Automaton has 15090 states and 22201 transitions. Word has length 332 [2025-02-06 02:22:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:56,838 INFO L471 AbstractCegarLoop]: Abstraction has 15090 states and 22201 transitions. [2025-02-06 02:22:56,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 7.129032258064516) internal successors, (221), 30 states have internal predecessors, (221), 12 states have call successors, (122), 4 states have call predecessors, (122), 9 states have return successors, (123), 12 states have call predecessors, (123), 12 states have call successors, (123) [2025-02-06 02:22:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 15090 states and 22201 transitions. [2025-02-06 02:22:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-06 02:22:56,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:56,845 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:56,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 02:22:57,045 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:22:57,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:57,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash -47437908, now seen corresponding path program 1 times [2025-02-06 02:22:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550578464] [2025-02-06 02:22:57,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:57,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-06 02:22:57,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-06 02:22:57,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:57,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 210 proven. 78 refuted. 0 times theorem prover too weak. 4612 trivial. 0 not checked. [2025-02-06 02:22:58,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550578464] [2025-02-06 02:22:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550578464] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264883330] [2025-02-06 02:22:58,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:58,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:58,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:22:58,660 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:22:58,664 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:22:58,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-06 02:22:58,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-06 02:22:58,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:58,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:58,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 02:22:58,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:23:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3128 proven. 357 refuted. 0 times theorem prover too weak. 1415 trivial. 0 not checked. [2025-02-06 02:23:02,246 INFO L312 TraceCheckSpWp]: Computing backward predicates...